Ant colony algorithm for layout optimization with equilibrium constraints

Kongzhi yu Juece/Control and Decision

Volumn 23, Issue 1, 2008, Pages 25-29

  Xu, Yi Chun ^a   Xiao, Ren Bin ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Ant colony optimization; Constrained layout optimization; Local search

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS;

ANT COLONY OPTIMIZATION; CONSTRAINED LAYOUT OPTIMIZATION; EQUILIBRIUM CONSTRAINTS; LOCAL SEARCH;

OPTIMIZATION;

EID: 39149136539     PISSN: 10010920     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Teng Hong-fei. Sun Shou-lin, Ge Wen-hai, et al. Layout optimization for the dishes installed on a rotating rable - The packing problem with equilibrium behavioral constrains [J]. Science in China (Series A), 1994, 37 (10): 1272-1279.
2. Tang Fei, Teng Hong-fei, A modified genetic algorithm and its application to layout optimization [J]. J of Software, 1999, 10 (10): 1096-1102.
3. Qian Zhi-qin, Teng Hong-fei, Sun Zhi-guo. Human-computer interactive genetic algorithm and its application to constrained layout optimization [J]. Chinese J of Computers, 2001, 24 (5): 553-559.
4. Yu Yang, Cha Jian-zhong. Tang Xiao-jun. Learning based GA and application in packing [J]. Chinese J of Computers, 2001, 24 (12): 1242-1249.
5. Liu Jian, Huang Wen-qi. A modified differential evolution algorithm for solving circles packing problem with constraints of equilibrium [J]. Information and Control, 2006, 35 (1): 103-107.
6. Li Ning, Liu Fei, Sun De-bao. A study on the particle swarm optimization with mutation operator constrained layout optimization [J]. Chinese J of Computers, 2004, 27 (7): 897-903.
7. Zhou Chi, Gao Liang, Gao Hai-bing. Particle swarm optimization based algorithm for constrained layout optimization [J]. Control and Decision, 2005, 20 (1): 36-40.
8. Liu D Q, Teng H F. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles [J]. European J of Operational Research, 1999, 112 (2): 413-420.
9. Huang Wen-qi, Xu Ru-chu. Introduction of computational theory - The study of NP hard problems and the algorithms [M]. Beijing: Science Press, 2004.
10. Huang Wen-qi, Liu Jing-fa. A deterministic heuristic algorithm based on euclidian distance for solving the rectangles packing problem [J]. Chinese J of Computers, 2006, 29 (5): 734-739.
11. George J A, George J M, Lamar B W. Packing different-sized circles into a rectangular container [J]. European J of Operational Research, 1995, 84 (3): 693-712.
12. Huang W Q, Li Y, Li C M, et al. New heuristics for packing unequal circles into a circular container [J]. Computers and Operations Research, 2006, 33 (8): 2125-2142.
13. Dorigo M, Dicaro G. The ant colony optimization metaheuristic [C]. New Ideas in Optimization. McGraw Hill, 1999.
14. Maniezzo V, Gambardella L M, De Luigi F. Ant colony optimization [C]. New Optimization Techniques in Engineering. Berlin Heidelberg: Springer-Verlag, 2004.