Layout optimization for the objects located within a rotating vessel — a three-dimensional packing problem with behavioral constraints

Teng, Hong‐Fei; Sun, Sanjun; Liu, Dequan; Li, Yan-zhao

doi:10.1016/s0305-0548(99)00132-x

Cited by 62 publications

(51 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instances 1 and 5 are from [7]; Instance 2 is from [8]; Instances 3 and 4 are from [6]. The optimal solutions of Instances 1 and 2 are known.…”

Section: Test Instancesmentioning

confidence: 99%

“…Teng et al [6] proposed heuristic algorithms including the method of model-changing iteration and the method of main objects topo-models. Tang and Teng [7] gave a modified genetic algorithm called decimal coded adaptive genetic algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…The absence of a powerful optimization method is the key obstacle to solving this type of problems. Different global search methods, including stochastic algorithms (for example, the genetic algorithm [7][8][9], and the particle swarm optimizer [10][11][12]) and heuristic algorithms (for example, the method of model-changing iteration [6], and the quasi-physical quasi-human algorithm [13]), have their respective limitations. On the one hand, stochastic algorithms have global search ability and broad adaptability; on the other hand they lack accuracy of search and speed of convergence.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints

Liu¹,

Li²

2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

With the background of the satellite module layout design, the circular packing problem with equilibrium behavioral constraints is a layout optimization problem and NP-hard problem in math. For lack of a powerful optimization method, this problem is hard to solve. The energy landscape paving (ELP) method is a class of stochastic global optimization algorithms based on the Monte Carlo sampling. Based on the quasiphysical strategy and the penalty function method, the problem is converted into an unconstrained optimization problem. Here by combining the improved ELP method, the gradient method based on local search and the heuristic configuration update mechanism, a new global search algorithm, basin filling algorithm, is put forward. The numerical results show that the proposed algorithm is effective to solving the circular packing problem with equilibrium behavioral constraints, and is easy to be popularized to other layout optimization problems. CitationLiu J F, Li G. Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints.

show abstract

“…Instances 1 and 5 are from [7]; Instance 2 is from [8]; Instances 3 and 4 are from [6]. The optimal solutions of Instances 1 and 2 are known.…”

Section: Test Instancesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints

Liu¹,

Li²

2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…[11], 5 rectangular objects and 5 circular objects will be located on a bearing plate with radius R=1750mm. Relevant data are given in Table 3, in which a i and b i are the longer and shorter edge of a rectangular object while r i is the radius of a circular object, and m i denotes the mass of every object.…”

Section: Numerical Examplementioning

confidence: 99%

Parallel Hybrid PSO-GA Algorithm and Its Application to Layout Design

Li¹,

Zhao²,

Guo³

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Packing and layout problems belong to NP-Complete problems theoretically and have found a wide utilization in practice. Parallel genetic algorithms (PGA) are relatively effective to solve these problems. But there still exist some defects of them, e.g. premature convergence and slow convergence rate. To overcome them, a parallel hybrid PSO-GA algorithm (PHPSO-GA) is proposed based on PGA. In PHPSO-GA, subpopulations are classified as several classes according to probability values of improved adaptive crossover and mutation operators. And in accordance with characteristics of different classes of subpopulations, different modes of PSO update operators are introduced. It aims at making full use of the fast convergence property of particle swarm optimization. Adjustable arithmetic-progression rank-based selection is introduced into this algorithm as well. It not only can prevent the algorithm from premature in the early stage of evolution but also can accelerate convergence rate in the late stage of evolution. To be hybridized with simplex method can improve local search performance. An example of layout design problem shows that PHPSO-GA is feasible and effective.

show abstract

“…In a series of works, Teng et al (2001), Sun and Teng (2003), Zhang et al (2008) and Teng et al (2010), studied the efficacy of the approach when applied to a spinning telecommunication satellite, considering also the influence of the application of different optimization methods. These works have in common the focus on placing the equipment driven by the system's mass properties (position of mass center and magnitude and direction of principal axis of inertia) requirements, subject to geometric constraints.…”

Section: Introductionmentioning

confidence: 99%

A Multidisciplinary Design Optimization Tool for Spacecraft Equipment Layout Conception

Lau

Sousa

Galski

et al. 2014

J.Aerosp. Technol. Manag.

View full text Add to dashboard Cite

One issue the design team has to face in the process of building a new spacecraft, is to define its mechanical and electrical architecture. The choice of where to place the spacecraft´s electronic equipment is a complex task, since it involves simultaneously many factors, such as the spacecraft´s required position of center of mass, moments of inertia, equipment heat dissipation, integration and servicing issues, among others. Since this is a multidisciplinary task, the early positioning of the spacecraft´s equipment is usually done "manually" by a group of system engineers, heavily based on their experience. It is an interactive process that takes time and hence, as soon as a feasible design is found, it becomes the baseline. This precludes a broader exploration of the design space, which may lead to a suboptimal solution, or worse to a design that will have to be modified later. Recently, it has been shown the potential benefits of automating the process of spacecraft´s equipment layout using optimization techniques. In this paper, a prototype of an Excel ® based tool for multidisciplinary spacecraft equipment layout conception is described. Provided the geometric dimensions, mass and heat dissipation of the equipment, and the available positioning area, the tool can automatically generate many possible trade-off solutions for the layout. It allows the user to set specific equipment to specific areas of positioning, and different combinations of objective functions can be used to drive the design. The features of the tool are shown in a simplified three dimensional problem.

show abstract

Layout optimization for the objects located within a rotating vessel — a three-dimensional packing problem with behavioral constraints

Cited by 62 publications

References 6 publications

Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints

Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints

Parallel Hybrid PSO-GA Algorithm and Its Application to Layout Design

A Multidisciplinary Design Optimization Tool for Spacecraft Equipment Layout Conception

Contact Info

Product

Resources

About