{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:31:33Z","timestamp":1770226293867,"version":"3.49.0"},"reference-count":48,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:00:00Z","timestamp":1613692800000},"content-version":"vor","delay-in-days":49,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The traveling salesman problem (TSP) is one of the most important issues in combinatorial optimization problems that are used in many engineering sciences and has attracted the attention of many scientists and researchers. In this issue, a salesman starts to move from a desired node called warehouse and returns to the starting place after meeting <jats:italic>n<\/jats:italic> customers provided that each customer is only met once. The aim of this issue is to determine a cycle with a minimum cost for this salesman. One of the major weaknesses of the PSO algorithm in the classical version is that it gets stuck in local optimizations. Therefore, in the proposed algorithm, called MPSO, the best solution in the current iteration is also used in the movement step. In addition, a variety of local search algorithms are provided that are used when better answers are generated than before. Also, a new method for moving the particle towards the best particle is presented, which, in addition to probably increasing the quality of the new answer, prevents the premature convergence of the algorithm due to consideration of the concept of random. The results evaluated with the results of several metaheuristic algorithms in the literature show the efficiency of the MPSO algorithm because it has been able to achieve excellent solutions in most of these instances.<\/jats:p>","DOI":"10.1155\/2021\/6668345","type":"journal-article","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T00:34:06Z","timestamp":1613781246000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1965-1594","authenticated-orcid":false,"given":"Majid","family":"Yousefikhoshbakht","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,2,19]]},"reference":[{"key":"e_1_2_8_1_2","first-page":"13","article-title":"An effective rank based ant system algorithm for solving the balanced vehicle routing problem","volume":"23","author":"Yousefikhoshbakht M.","year":"2016","journal-title":"International Journal of Industrial Engineering"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2003.11.001"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207548908942657"},{"key":"e_1_2_8_4_2","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler E. L.","year":"1985"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1996.506522"},{"key":"e_1_2_8_6_2","unstructured":"ZhangW. Truncated branch-and-bound: a case study on the asymmetric tsp Proceedings of the Working Note of AAAI 1993 Spring Symposium: AI and NP-Hard Problems 1993 Stanford CA USA 160\u2013166."},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.nonrwa.2008.03.014"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0826"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.5.698"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1504\/ijmme.2016.074590"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.3233\/ifs-120697"},{"key":"e_1_2_8_13_2","first-page":"63","article-title":"A hybrid effective genetic algorithm for solving the vehicle routing problem","volume":"21","author":"Zafari A.","year":"2010","journal-title":"International Journal of Industrial Engineering & Production Research"},{"key":"e_1_2_8_14_2","first-page":"37","article-title":"A mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem","volume":"8","author":"Yousefikhoshbakht M.","year":"2015","journal-title":"Journal of Optimization in Industrial Engineering"},{"key":"e_1_2_8_15_2","first-page":"169","article-title":"A combined metaheuristic algorithm for the vehicle routing problem and its open version","volume":"7","author":"YousefiKhoshbakht M.","year":"2019","journal-title":"Journal of AI and Data Mining"},{"key":"e_1_2_8_16_2","first-page":"81","article-title":"A combination of meta-heuristic and heuristic algorithms for the VRP, OVRP and VRP with simultaneous pickup and delivery","volume":"8","author":"Ashouri M.","year":"2017","journal-title":"Brain Broad Research in Artificial Intelligence and Neuroscience"},{"key":"e_1_2_8_17_2","article-title":"Solving the vehicle routing problem by an effective reactive bone route algorithm","volume":"2","author":"Eskandaria Z. S.","year":"2012","journal-title":"Transportation Research"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2014.3.161"},{"key":"e_1_2_8_19_2","article-title":"Solving the open vehicle routing problem by a hybrid ant colony optimization","volume":"41","author":"Sedighpour M.","year":"2014","journal-title":"Kuwait Journal of Science"},{"key":"e_1_2_8_20_2","article-title":"Simultaneous optimization of flotation column performance using genetic evolutionary algorithm","volume":"52","author":"Nakhaei F.","year":"2016","journal-title":"Physicochemical Problems of Mineral Processing"},{"key":"e_1_2_8_21_2","doi-asserted-by":"crossref","unstructured":"RayS. S. BandyopadhyayS. andPalS. K. New operators of genetic algorithms for traveling salesman problem Proceedings of the 17th International Conference on Pattern Recognition 2004 Cambridge UK 497\u2013500.","DOI":"10.1109\/ICPR.2004.1334276"},{"key":"e_1_2_8_22_2","unstructured":"ZhongW. ZhangJ. andChenW. A novel discrete particle swarm optimization to solve traveling salesman problem Proceedings of the 2007 IEEE Congress on Evolutionary Computation 2007 Singapore 3283\u20133287."},{"key":"e_1_2_8_23_2","doi-asserted-by":"crossref","unstructured":"WongL. P. LowM. Y. H. andChongC. S. A bee Colony optimization algorithm for traveling salesman problem Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) 2008 Kuala Lumpur Malaysia 818\u2013823.","DOI":"10.1109\/AMS.2008.27"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2013.3.7"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2469-3"},{"key":"e_1_2_8_26_2","article-title":"A niching memetic algorithm for multi-solution traveling salesman problem","volume":"24","author":"Huang T.","year":"2019","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_2_8_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jestch.2019.11.005"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/1712630"},{"key":"e_1_2_8_29_2","first-page":"68","article-title":"A modified elite ACO based avoiding premature convergence for traveling salesmen problem","volume":"7","author":"Yousefikhoshbakht M.","year":"2011","journal-title":"Journal of Industrial Engineering International"},{"key":"e_1_2_8_30_2","doi-asserted-by":"publisher","DOI":"10.4995\/ijpme.2016.4618"},{"key":"e_1_2_8_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.072"},{"key":"e_1_2_8_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2008.06.001"},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.06.012"},{"key":"e_1_2_8_34_2","doi-asserted-by":"crossref","unstructured":"KennedyJ.andEberhartR. Particle swarm optimization Proceedings of IEEE International Conference on Neural Networks 1995 Perth Australia 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_2_8_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103905"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3030950"},{"key":"e_1_2_8_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113353"},{"key":"e_1_2_8_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12127-3_10"},{"key":"e_1_2_8_39_2","doi-asserted-by":"publisher","DOI":"10.3390\/math7040357"},{"key":"e_1_2_8_40_2","doi-asserted-by":"crossref","unstructured":"OuC.andLinW. Comparison between PSO and GA for parameters optimization of PID controller Proceedings of the 2006 International Conference on Mechatronics and Automation 2006 Luoyang China IEEE 2471\u20132475.","DOI":"10.1109\/ICMA.2006.257739"},{"key":"e_1_2_8_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107804"},{"key":"e_1_2_8_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2020.2968743"},{"key":"e_1_2_8_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jobe.2020.101505"},{"key":"e_1_2_8_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01420-9"},{"key":"e_1_2_8_45_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-08009-7"},{"key":"e_1_2_8_46_2","first-page":"355","article-title":"A hybrid algorithm for the open vehicle routing problem","volume":"9","author":"Maleki F.","year":"2019","journal-title":"International Journal of Optimization in Civil Engineering"},{"key":"e_1_2_8_47_2","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5692792"},{"key":"e_1_2_8_48_2","first-page":"89","article-title":"Solving the capacitated clustering problem by a combined meta-heuristic algorithm","volume":"4","author":"Mahmoodi Darani N.","year":"2013","journal-title":"Journal of Advances in Computer Research"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6668345.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6668345.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6668345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:10:35Z","timestamp":1723241435000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6668345"}},"subtitle":[],"editor":[{"given":"Dimitri","family":"Volchenkov","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6668345"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6668345","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-12-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6668345"}}