Particle Swarm Algorithm for Weighted Rectangle Placement

Xu, Yichun; Xiao, Renbin; Amos, Martyn

doi:10.1109/icnc.2007.542

Cited by 7 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6 Heuristic search methods show good results for the WCL problem; 9,14 however, their performance is reduced significantly for WRL problem in three dimensional (3D) space. 4,5 This is due to the fact that appropriate layout design problem related not only to the location of every components but also to their orientation.…”

Section: Modeling Of the Space Propulsion Systemmentioning

confidence: 99%

“…Most of the research works considered the problem of positioning weighted items in a circular container, where each component has a constant mass. 5,6 These research works are intended to find a reasonable placement for these objects inside and or outside the satellite module to optimize the design objectives, while satisfying the spatial and performance constraints. 7,8 None of these mentioned research works, considered specific requirements, which are essential for the satellite stability such as propulsion subsystem requirements.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Layout design optimization of a space propulsion system using hybrid optimization algorithm

Shafaee

Mohammadzadeh

Abbasi

2016

Proceedings of the Institution of Mechanical Engineers, Part G:

View full text Add to dashboard Cite

The layout design problem of a propulsion system is complex and time-consuming process. This is mainly due to geometrical and performance constraints and system requirements. In addition, layout design optimization of a space propulsion system is non-linear, non-convex, and multimodal, which makes it difficult to implement conventional optimization methods to this class of design problems. This paper presents a hybrid optimization algorithm using genetic algorithm and sequential quadratic programming for optimal layout design of a space propulsion system. Previous research works mainly focused on the layout design components with constant parts. However, the approach adopted in this paper involves both variable mass component and hybrid optimization algorithm (GA-SQP) of a space propulsion system. The proposed hybrid optimization algorithm explores globally the design search space to locate the most promising region using genetic algorithm, whereas gradient-based sequential quadratic programming algorithm is used to reduce the computational time with a high degree of accuracy. The results obtained show that the proposed method provides an effective way of solving layout design optimization problem using both variable mass components method and a hybrid optimization for optimal layout design of a space propulsion system.

show abstract

Section: Modeling Of the Space Propulsion Systemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Layout design optimization of a space propulsion system using hybrid optimization algorithm

Shafaee

Mohammadzadeh

Abbasi

2016

Proceedings of the Institution of Mechanical Engineers, Part G:

View full text Add to dashboard Cite

show abstract

“…Properties. Xu et al [34] defined the embedded degrees between two rectangles and between the rectangle and container by Definitions 3 and 4, respectively. Definition 3.…”

Section: Embedded Degree Function and Relatedmentioning

confidence: 99%

“…In 1999, Feng et al [33] built a mathematical model of this problem and analyzed the isomorphism and equivalent intrinsic properties among its layout schemes by using the graph theory and group theory and proposed a theoretical global optimization algorithm. In 2007, Xu et al [34] defined embedded degree functions between two rectangles and between the rectangle and circular container and presented a compaction algorithm with the particle swarm local search (CA-PSLS). Their idea is that a feasible solution with a smaller envelope radius obtained through the gradient method is taken as an elite individual and the optimal solution is obtained by the PSO iteration.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Quasiphysical and Dynamic Adjustment Approach for Packing the Orthogonal Unequal Rectangles in a Circle with a Mass Balance: Satellite Payload Packing

Wang

Tan

et al. 2014

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Packing orthogonal unequal rectangles in a circle with a mass balance (BCOURP) is a typical combinational optimization problem with the NP-hard nature. This paper proposes an effective quasiphysical and dynamic adjustment approach (QPDAA). Two embedded degree functions between two orthogonal rectangles and between an orthogonal rectangle and the container are defined, respectively, and the extruded potential energy function and extruded resultant force formula are constructed based on them. By an elimination of the extruded resultant force, the dynamic rectangle adjustment, and an iteration of the translation, the potential energy and static imbalance of the system can be quickly decreased to minima. The continuity and monotony of two embedded degree functions are proved to ensure the compactness of the optimal solution. Numerical experiments show that the proposed QPDAA is superior to existing approaches in performance.

show abstract

Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches

Bouzid

Salhi

2020

European Journal of Operational Research

View full text Add to dashboard Cite

Particle Swarm Algorithm for Weighted Rectangle Placement

Cited by 7 publications

References 9 publications

Layout design optimization of a space propulsion system using hybrid optimization algorithm

Layout design optimization of a space propulsion system using hybrid optimization algorithm

A Quasiphysical and Dynamic Adjustment Approach for Packing the Orthogonal Unequal Rectangles in a Circle with a Mass Balance: Satellite Payload Packing

Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches

Contact Info

Product

Resources

About