{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:58:51Z","timestamp":1781103531145,"version":"3.54.1"},"reference-count":15,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,10,1]]},"abstract":"<p>The Combinatorial problems are real world decision making problem with discrete and disjunctive choices. When these decision making problems involve more than one conflicting objective and constraint, it turns the polynomial time problem into NP-hard. Thus, the straight forward approaches to solve multi-objective problems would not give an optimal solution. In such case evolutionary based meta-heuristic approaches are found suitable. In this paper, a novel particle swarm optimization based meta-heuristic algorithm is presented to solve multi-objective combinatorial optimization problems. Here a mapping method is considered to convert the binary and discrete values (solution encoded as particles) to a continuous domain and update it using the velocity and position update equation of particle swarm optimization to find new set of solutions in continuous domain and demap it to discrete values. The performance of the algorithm is compared with other evolutionary strategy like SPEA and NSGA-II on pseudo-Boolean discrete problems and multi-objective 0\/1 knapsack problem. The experimental results confirmed the better performance of combinatorial particle swarm optimization algorithm.<\/p>","DOI":"10.4018\/jamc.2011100104","type":"journal-article","created":{"date-parts":[[2012,1,13]],"date-time":"2012-01-13T11:40:46Z","timestamp":1326454846000},"page":"41-57","source":"Crossref","is-referenced-by-count":36,"title":["A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem"],"prefix":"10.4018","volume":"2","author":[{"given":"Rahul","family":"Roy","sequence":"first","affiliation":[{"name":"KIIT University, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1435-4531","authenticated-orcid":true,"given":"Satchidananda","family":"Dehuri","sequence":"additional","affiliation":[{"name":"Fakir Mohan University, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sung Bae","family":"Cho","sequence":"additional","affiliation":[{"name":"Yonsei University, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2011100104-0","doi-asserted-by":"crossref","unstructured":"Coello, C. A. C., & Lechuga, M. (2002). MOPSO: a proposal for multi-objective particle swarm optimization. In Proceedings of the 9th IEEE, World Congress on Computational Intelligence, Honolulu, HI (pp. 1051-1056).","DOI":"10.1109\/CEC.2002.1004388"},{"key":"jamc.2011100104-1","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2011040103"},{"key":"jamc.2011100104-2","author":"K.Deb","year":"1995","journal-title":"Optimization for engineering design: algorithms and examples"},{"key":"jamc.2011100104-3","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"jamc.2011100104-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2008.11.002"},{"key":"jamc.2011100104-5","author":"M. R.Garey","year":"1990","journal-title":"Computers and intractability: A guide to the theory of NP-completeness"},{"key":"jamc.2011100104-6","unstructured":"Grosan, C., Oltean, M., & Dumitrescu, D. (2003). Performance metrics for multi-objective optimization evolutionary algorithms. In Proceedings of the Conference on Applied and Industrial Mathematics, Oradea, Romania."},{"key":"jamc.2011100104-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.04.096"},{"key":"jamc.2011100104-8","unstructured":"Jaszkiewicz, A. (2000). On the performance of multiple objective genetic local search on the 0\/1 knapsack problem: A comparative experiment (Working Paper No. RA002\/2000). Poznan, Poland: Institute of Computer Science, Poznan University of Technology."},{"key":"jamc.2011100104-9","unstructured":"Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., & Deb, K. (2002). Running time analysis of algorithm on vector-valued pseudo Boolean functions (Tech. Rep. No. TIK-165). Zurich, Switzerland: Swiss Federal Institute of Technology."},{"key":"jamc.2011100104-10","doi-asserted-by":"crossref","unstructured":"Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., & Deb, K. (2002). Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem (Tech. Rep. No. TIK-123). Zurich, Switzerland: Swiss Federal Institute of Technology.","DOI":"10.1007\/3-540-45712-7_5"},{"key":"jamc.2011100104-11","author":"S.Martello","year":"1990","journal-title":"Knapsack problem: algorithms and computer implementation"},{"key":"jamc.2011100104-12","doi-asserted-by":"crossref","unstructured":"Mostaghim, S., & Teich, J. (2003). Strategies for finding good local guides in multi-objective particle swarm optimization. In Proceedings of the IEEE Symposium on Swarm Intelligence (pp. 26-33).","DOI":"10.1109\/SIS.2003.1202243"},{"key":"jamc.2011100104-13","author":"E.Zitzler","year":"1999","journal-title":"Comparison of multiobjective evolutionary algorithms: empirical results"},{"key":"jamc.2011100104-14","unstructured":"Zitzler, E., & Thiele, L. (1998). An evolutionary algorithm for multi-objective optimization: the strength pareto approach (Tech. Rep. No. TIK-43). Zurich, Switzerland: Swiss Federal Institute of Technology."}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=62305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:42:20Z","timestamp":1654116140000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2011100104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,10,1]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2011100104","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,1]]}}}