Abstract
The complex layout optimization problems with behavioral constraints belong to NP-hard problem in math. Due to its complexity, the general particle swarm optimization algorithm converges slowly and easily to local optima. Taking the layout problem of satellite cabins as background, a novel adaptive particle swarm optimizer based on multi-modified strategies is proposed in the paper, which can not only escape from the attraction of local optima of the later phase to heighten particle diversity, and avoid premature problem, but also maintain the characteristic of fast speed search in the early convergence phase to get global optimum, thus, the algorithm has a better search performance to deal with the constrained layout optimization problem. The proposed algorithm is tested and compared it with other published methods on constrained layout examples, demonstrated that the revised algorithm is feasible and efficient.
The work is supported by Key Project of Chinese Ministry of Education (104262).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Teng, H., Shoulin, S., Wenhai, G., et al.: Layout optimization for the dishes installed on rotating table. Science in China (Series A) 37(10), 1272–1280 (1994)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. of IEEE Int’l Conf. Neural Networks, pp. 1942–1948. IEEE Computer Press, Indianapolis (1995)
Eberhart, R.C., Kennedy, J.: A new optimizer using particles swarm theory. In: Sixth International Symposium on Micro Machine and Human Science, pp. 39–43. IEEE Service Center, Piscataway (1995)
Angeline, P.J.: Using selection to improve particle swarm optimization. In: Proc. IJCNN 1999, pp. 84–89. IEEE Computer Press, Indianapolis (1999)
Lei, K., Qiu, Y., He, Y.: A new adaptive well-chosen inertia weight strategy to automatically harmonize global and local search ability in particle swarm optimization. In: 1st International Symposium on Systems and Control in Aerospace and Astronautics, pp. 342–346. IEEE Press, Harbin (2006)
Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proc. of the IEEE Con. Evolutionary Computation, pp. 69–73. IEEE Computer Press, Piscataway (1998)
Jianchao, Z., Zhihua, C.: A guaranteed global convergence particle swarm optimizer. Journal of Computer Research and Development 4(8), 1334–1338 (2004) (in Chinese)
Fei, T., Hongfei, T.: A modified genetic algorithm and its application to layout optimization. Journal of Software 10(10), 1096–1102 (1999) (in Chinese)
Ning, L., Fei, L., Debao, S.: A study on the particle swarm optimization with mutation operator constrained layout optimization. Chinese Journal of Computers 27(7), 897–903 (2004) (in Chinese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lei, K. (2009). Research on Constrained Layout Optimization Problem Using Multi-adaptive Strategies Particle Swarm Optimizer. In: Deng, H., Wang, L., Wang, F.L., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2009. Lecture Notes in Computer Science(), vol 5855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05253-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-05253-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05252-1
Online ISBN: 978-3-642-05253-8
eBook Packages: Computer ScienceComputer Science (R0)