Abstract
Multi-objective optimization methods are essential to resolve real-world problems as most involve several types of objects. For this solution several multi-objective genetic algorithms are proposed. This paper presents a Crowding-distance-based Multi-objective Particle Swarm Optimization (CMPSO) algorithm. According to the size of archive members’ crowding-distance, the algorithm selects the global optimal position in the archive for each particle on the basis of Roulette Gambling and maintains external archives based on crowding distance. Finally, three tests are conducted to evaluate this algorithm. The experiment results show that CMPSO has better ability to continuously optimize the performance, shorter running time, better convergence and robustness, compared with strength Pareto EA (SPEA2) and some other common algorithms.
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
Parsopoulos, K.E., Vrahatis, M.N.: Particle swam optimizati-on method in multi-objective problems. In: Proceedings of the ACM Symposium on Applied Computing, pp. 603–607 (2002)
Schaffer, D.: Multiple objective optimization with vector evaluated genetic algorithm. In: Proc. 1st international conference on genetic algorithm (93-1001985)
Li, X.: Better spread and convergence: particle swarm multi-objective optimization using the maximin fitness function. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 117–128. Springer, Heidelberg (2004)
Deb, K., Pratap, A., Agarwal, S., et al.: A fast and elitist multi-objective genetic algorithms: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 182–197 (2002)
Coello Coello, C.A., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation 8, 256–279 (2004)
Knowles, J.D., Corne, D.W.: Approximating the non-dominated front using the Pareto archive evolutionary strategy. Evolutionary Computation 8, 149–172.b (2000)
You-lian, Z., Jun-qing, F.: Crowding-measure-based multi-objective particle swarm optimization. Journal of Hubei University 30, 141–144 (2008)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2.: Improving the strength Pareto evolutionary algorithm, Swiss Federal Institute of Technology, Lausanne, Switzerland, Tech. Rep. TIK-Rep 103 (2001)
De-Ming, L., Zhi-Ming, W.: Crowding-Measure Based Multi-Objective Evolutionary Algorithm. Chinese Journal of Computer 28, 1320–1326 (2005)
Deb, K.: Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evolutionary Computation 7, 205–230 (1999)
Deb, K., Thiele, L., Laumanns, M., et al.: Scalable multi-objective optimization test problems. In: Proc. 2002 Cong. Evolutionary Computation, Piscataway, NJ, pp. 825–890 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, J., Zhao, L., Du, L., Zheng, Y. (2010). Crowding-Distance-Based Multi-objective Particle Swarm Optimization. In: Cai, Z., Tong, H., Kang, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2010. Communications in Computer and Information Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16388-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-16388-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16387-6
Online ISBN: 978-3-642-16388-3
eBook Packages: Computer ScienceComputer Science (R0)