{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T13:56:03Z","timestamp":1781272563840,"version":"3.54.1"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T00:00:00Z","timestamp":1270080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/tevc.2009.2030331","type":"journal-article","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T18:36:54Z","timestamp":1257273414000},"page":"278-300","source":"Crossref","is-referenced-by-count":369,"title":["A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems"],"prefix":"10.1109","volume":"14","author":[{"family":"Wei-Neng Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Jun Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.S.H.","family":"Chung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Wen-Liang Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Wei-Gang Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Yu-hui Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref38","first-page":"3283","article-title":"a novel discrete particle swarm optimization to solve traveling salesman problem","author":"zhong","year":"2007","journal-title":"Proc IEEE Int Conf Evol Comput (CEC)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004497"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009642405419"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004493"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.785509"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref35","first-page":"469","article-title":"hybrid particle swarm optimizer with breeding and subpopulations","author":"lovbjerg","year":"2001","journal-title":"Proc Genetic Evol Comput Conf"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826071"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/11730095_9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2001.934374"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699146"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.03.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIS.2006.252316"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.epsr.2006.02.016"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.08.030"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICHIS.2005.86"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2006.05.082"},{"key":"ref50","article-title":"evolutionary algorithm for multidimensional knapsack problem","author":"findanova","year":"2002","journal-title":"Proc 7th Int Conf Parallel Problem Solving Nature Workshop"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"ref10","author":"clerc","year":"2004","journal-title":"New Optimization Techniques in Engineering"},{"key":"ref11","first-page":"1583","article-title":"particle swarm optimization for traveling salesman problem","author":"wang","year":"2003","journal-title":"Proc Int Conf Mach Learn Cybern"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592327"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0141-9331(02)00053-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2006.09.002"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/ICMLC.2004.1382191","article-title":"modified particle swarm optimization based on space and transformation for solving traveling salesman problem","author":"pang","year":"2004","journal-title":"Proc 3rd Int Conf Mach Learning Cybern"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/CIT.2004.1357292","article-title":"fuzzy discrete particle swarm optimization for solving traveling salesman problem","author":"pang","year":"2004","journal-title":"Proc 4th Int Conf Comput Information Technol (CIT)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.017"},{"key":"ref17","first-page":"859","article-title":"heuristic information based improved fuzzy discrete pso method for solving tsp","author":"shen","year":"2006","journal-title":"Proc 9th Pacific Rim Int Conf Artif Intell (PRICAI)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2006.10.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/EURCON.2005.1629899"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"ref3","first-page":"101","article-title":"fuzzy adaptive particle swarm optimization","volume":"1","author":"shi","year":"2001","journal-title":"Proc IEEE Int Conf Evol Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826069"},{"key":"ref8","first-page":"306","author":"al-kazemi","year":"2006","journal-title":"Information Processing with Evolutionary Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"ref49","first-page":"63","article-title":"ant algorithm for the multi-dimensional knapsack problem","author":"alaya","year":"2004","journal-title":"Proc Int Conf Bio-Inspired Optimization Methods Their Appl (BIOMA)"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/CEC.2005.1554671","article-title":"combining particle swarm optimisation with angle modulation to solve binary problems","volume":"1","author":"pampara","year":"0","journal-title":"Proc 2005 IEEE Congr Evol Comput"},{"key":"ref46","author":"reinelt","year":"1994","journal-title":"The Traveling Salesman Computational Solutions for TSP Applications"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s00500-003-0317-8","article-title":"some issues of designing genetic algorithms for traveling salesman problems","volume":"8","author":"tsai","year":"2004","journal-title":"Soft Comput"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782655"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/11785231_119"},{"key":"ref42","first-page":"42","author":"grefenstette","year":"1987","journal-title":"Genetic Algorithms Simulated Annealing"},{"key":"ref41","first-page":"450","article-title":"edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem","author":"nagata","year":"1997","journal-title":"Proc 7th Int Conf Genetic Algorithms"},{"key":"ref44","first-page":"803","article-title":"inver-over operator for the tsp","author":"tao","year":"1998","journal-title":"Proc Parallel Problem Solving Nature V (PPSN V)"},{"key":"ref43","first-page":"890","article-title":"new genetic local search operators for the traveling salesman problem","author":"freisleben","year":"1996","journal-title":"Proc 4th Parallel Problem Solving Nature (PPSN 4)"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/5438925\/05299261.pdf?arnumber=5299261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T01:51:01Z","timestamp":1739411461000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5299261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":51,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2009.2030331","relation":{},"ISSN":["1941-0026","1089-778X"],"issn-type":[{"value":"1941-0026","type":"electronic"},{"value":"1089-778X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,4]]}}}