Title :
Orthogonal cultural optimization algorithm and its application in layout optimization
Author_Institution :
Dept. of Comput. Sci., Shijiazhuang Univ. of Econ., Shijiazhuang, China
Abstract :
Layout optimization problems arise widely in engineering applications and are now recognized as an important category of combinatorial optimization problems. However most unconstrained layout optimization problems are NP-Complete. There are constrained and unconstrained layout optimization problems, the former is more difficult. An orthogonal cultural optimization algorithm is proposed by integrating the Differential Evolution algorithm and GuoTao algorithm into the Culture algorithm framework. The algorithm uses the orthogonal design to generate initial population. They compare the performance of the system on a constrained layout optimization and on a large-scale unconstrained test case. Experimental results demonstrate a dramatic improvement on the precision of layout result, and the algorithm efficiency has been demonstrated.
Keywords :
combinatorial mathematics; computational complexity; evolutionary computation; optimisation; GuoTao algorithm; NP-complete problems; combinatorial optimization problems; culture algorithm framework; differential evolution algorithm; engineering applications; large-scale unconstrained test case; orthogonal cultural optimization algorithm; orthogonal design; unconstrained layout optimization problems; Algorithm design and analysis; Arrays; Computers; Cultural differences; Evolutionary computation; Layout; Optimization;
Conference_Titel :
Information Science and Technology (ICIST), 2012 International Conference on
Conference_Location :
Hubei
Print_ISBN :
978-1-4577-0343-0
DOI :
10.1109/ICIST.2012.6221657