{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T06:16:20Z","timestamp":1772345780338,"version":"3.50.1"},"reference-count":20,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7,1]]},"abstract":"<p>Particle Swarm Optimization (PSO) is one of the most effective metaheuristics algorithms, with many successful real-world applications. The reason for the success of PSO is the movement behavior, which allows the swarm to effectively explore the search space. Unfortunately, the original PSO algorithm is only suitable for single objective optimization problems. In this paper, three movement strategies are discussed for multi-objective PSO (MOPSO) and popular test problems are used to confirm their effectiveness. In addition, these algorithms are also applied to solve the engineering design and portfolio optimization problems. Results show that the algorithms are effective with both direct and indirect encoding schemes.<\/p>","DOI":"10.4018\/jamc.2010070105","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T20:23:11Z","timestamp":1297801391000},"page":"59-79","source":"Crossref","is-referenced-by-count":28,"title":["Movement Strategies for Multi-Objective Particle Swarm Optimization"],"prefix":"10.4018","volume":"1","author":[{"given":"S.","family":"Nguyen","sequence":"first","affiliation":[{"name":"Asian Institute of Technology, Thailand"}]},{"given":"V.","family":"Kachitvichyanukul","sequence":"additional","affiliation":[{"name":"Asian Institute of Technology, Thailand"}]}],"member":"2432","reference":[{"key":"jamc.2010070105-0","unstructured":"Beasley, J. E. (2006). OR-library. Retrieved from http:\/\/people.brunel.ac.uk\/mastjjb\/jeb\/info.html"},{"key":"jamc.2010070105-1","unstructured":"Cesarone, F., Scozzari, A., & Tardella, F. (2008). Efficient algorithms for mean-variance portfolio optimization with Hard Real -World Constraints. In Proceedings of the 18th International AFIR Colloquium, Rome, Italy."},{"key":"jamc.2010070105-2","doi-asserted-by":"publisher","DOI":"10.1080\/03052159908941377"},{"key":"jamc.2010070105-3","unstructured":"Coello Coello, C. A., & Lechuga, M. S. (2002). MOPSO: A proposal for multiple objective particle swarm optimization, Evolutionary Computation. In Proceedings of the 2002 Congress on Evolutionary Computation (Vol. 2, pp. 1051-1056)."},{"key":"jamc.2010070105-4","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"jamc.2010070105-5","unstructured":"Fieldsend, J., & Singh, S. (2002). A multi-objective algorithm based upon article swarm optimisation, an efficient data structure and turbulence. In Proceedings of the 2002 U.K. Workshop on Computational Intelligence, Birmingham, UK (pp. 37-44)."},{"key":"jamc.2010070105-6","unstructured":"Hu, X., & Eberhart, H. (2002). Multiobjective optimization using dynamic Neighborhood Particle Swarm Optimization. In Proceedings of the Congress on Evolutionary Computation (CEC' 2002), Picataway, NJ (Vol. 2, pp. 1677-1681). Washington, DC: IEEE."},{"key":"jamc.2010070105-7","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings, IEEE International Conference on Neural Networks (Vol. 4, pp. 1942-1948).","DOI":"10.1109\/ICNN.1995.488968"},{"key":"jamc.2010070105-8","doi-asserted-by":"crossref","unstructured":"Li, X. (2003). A non-dominated sorting particle swarm optimizer for multiobjective optimization. In Proceedings of the 2003 international conference on Genetic and evolutionary computation: Part I, Chicago (pp. 37-48).","DOI":"10.1007\/3-540-45105-6_4"},{"key":"jamc.2010070105-9","doi-asserted-by":"publisher","DOI":"10.2307\/2975974"},{"key":"jamc.2010070105-10","doi-asserted-by":"crossref","unstructured":"Parsopoulos, K. E., & Vrahatis, M. N. (2002). Particle swarm optimization method in multiobjective problems. In Proceeding of the 2002 ACM Symposium on Applied Computing (SAC\u2019 2002), Madrid, Spain (pp. 603-607). New York: ACM Press.","DOI":"10.1145\/508791.508907"},{"key":"jamc.2010070105-11","unstructured":"Pongchairerks, P., & Kachitvichyanukul, V. (2005). Non-homogenous particle swarm optimization with multiple social structures. In V. Kachitvichyanukul, U. Purintrapiban, & P. Utayopas (Eds.), In Proceedings of the Simulation and Modeling: Integrating Sciences and Technology for Effective Resource Management, the international conference on simulation and modeling, Asian Institute of Technology, Bangkok, Thailand."},{"key":"jamc.2010070105-12","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2009.026534"},{"key":"jamc.2010070105-13","doi-asserted-by":"crossref","unstructured":"Raquel, C., Prospero, C., & Naval, Jr. (2005). An effective use of crowding distance in multiobjective particle swarm optimization. In Proceedings of the 2005 conference on Genetic and evolutionary computation, Washington, DC.","DOI":"10.1145\/1068009.1068047"},{"key":"jamc.2010070105-14","unstructured":"Shi, Y., & Eberhart, R. (1998). A modified particle swarm optimizer. In Proceedings of the Evolutionary Computation World Congress on Computational Intelligence (pp. 69-73). Washington, DC: IEEE."},{"key":"jamc.2010070105-15","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"jamc.2010070105-16","doi-asserted-by":"crossref","unstructured":"Veeramachaneni, K., Peram, T., Mohan, C., & Osadciw, L. A. (2003). Optimization Using Particle Swarms with Near Neighbour Interactions (LNCS 2723). New York: Springer. ISBN:0302-9743","DOI":"10.1007\/3-540-45105-6_10"},{"key":"jamc.2010070105-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2007.08.002"},{"key":"jamc.2010070105-18","unstructured":"Zeng, F., Low, M. Y. H., Decraene, J., Zhou, S., & Cai, W. (2010). Self-Adaptive Mechanism for Multi-objective Evolutionary Algorithms. In Proceedings of the 2010 IAENG International Conference on Artificial Intelligence and Applications."},{"key":"jamc.2010070105-19","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=47376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:42:02Z","timestamp":1654094522000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2010070105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2010070105","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}