{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T03:04:20Z","timestamp":1770606260293,"version":"3.49.0"},"reference-count":81,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation, in November 2021","doi-asserted-by":"publisher","award":["70-2021-00143"],"award-info":[{"award-number":["70-2021-00143"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020409","name":"Analytical Center for the Government of the Russian Federation, in November 2021","doi-asserted-by":"publisher","award":["IGK 000000D730321P5Q0002"],"award-info":[{"award-number":["IGK 000000D730321P5Q0002"]}],"id":[{"id":"10.13039\/100020409","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3320562","type":"journal-article","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T17:45:30Z","timestamp":1696009530000},"page":"106544-106566","source":"Crossref","is-referenced-by-count":11,"title":["D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm"],"prefix":"10.1109","volume":"11","author":[{"given":"Poria","family":"Pirozmand","sequence":"first","affiliation":[{"name":"Faculty of Higher Education, Holmes Institute, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Asghar Rahmani","family":"Hosseinabadi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Regina, Regina, SK, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maedeh Jabbari","family":"Chari","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Islamic Azad University of Masjed Soleiman, Masjed Soleyman, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faezeh","family":"Pahlavan","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, University of Mazandaran, Babolsar, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyedsaeid","family":"Mirkamali","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and IT, Payame Noor University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0849-7771","authenticated-orcid":false,"given":"Gerhard-Wilhelm","family":"Weber","sequence":"additional","affiliation":[{"name":"Faculty of Engineering Management, Poznań University of Technology, Poznań, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Summera","family":"Nosheen","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, School of Electrical and Information Engineering, The University of Sydney, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0169-6738","authenticated-orcid":false,"given":"Ajith","family":"Abraham","sequence":"additional","affiliation":[{"name":"School of Computer Science Engineering and Technology, Bennett University, Greater Noida, Uttar Pradesh, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","volume":"840","author":"reinelt","year":"2003","journal-title":"The Traveling Salesman Computational Solutions for TSP Applications"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.065"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(87)90002-2"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101056"},{"key":"ref15","volume":"2050","author":"bellman","year":"2015","journal-title":"Applied Dynamic Programming"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103649"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1980.188"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104950"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115948"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104061"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-023-04541-9"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.08.041"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2005.10.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.06.007"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12001"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104006"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107199"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3228918"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213019500040"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106177"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2828499"},{"key":"ref41","first-page":"1","article-title":"Solving multiple traveling salesman problem using the gravitational emulation local search algorithm","volume":"9","author":"rostami","year":"2015","journal-title":"Appl Math Inf Sci"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07816-y"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.03.012"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108157"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108469"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114639"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-020-09429-x"},{"key":"ref3","article-title":"A discrete spotted hyena optimizer for solving distributed job shop scheduling problems","volume":"106","author":"?ahman","year":"2021","journal-title":"Appl Soft Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3233852"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbenv.2021.04.002"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/5043058"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2014.7066271"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3128814"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.079"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04539-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.01.053"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06002-w"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.08.067"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-017-2663-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.10.006"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2608-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.03.007"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105211"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1978-9"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2957722"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-179668"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2017.02.042"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104850"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107298"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101454"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.07.024"},{"key":"ref71","first-page":"202","article-title":"Cooperative grey games: Grey solutions and an optimization algorithm","volume":"4","author":"palanci","year":"2017","journal-title":"[GS] International J Supply Oper Manag"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-016-0464-5"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.3390\/su10051366"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-017-1159-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2014.08.002"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1177\/0734242X18807001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jestch.2017.08.005"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/0141-9331(92)90038-U"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2945570"},{"key":"ref69","article-title":"A novel interactive fuzzy programming approach for optimization of allied closed-loop supply chains","author":"calik","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.01.015"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-021-01286-x"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.3390\/s19081837","article-title":"Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem","volume":"19","author":"hindi","year":"2019","journal-title":"SENSORS"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/847\/1\/012027"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3177-y"},{"key":"ref65","author":"chen","year":"2021","journal-title":"The TSPLIB Symmetric Traveling Salesman Problem Instances"},{"key":"ref28","article-title":"An idea based on honey bee swarm for numerical optimization","author":"karaboga","year":"2005"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2952644"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115353"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.03.001"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116814"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10268392.pdf?arnumber=10268392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:18:32Z","timestamp":1698085112000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10268392\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":81,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3320562","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}