{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:04:21Z","timestamp":1775145861539,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3366183","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:54:04Z","timestamp":1707936844000},"page":"26655-26666","source":"Crossref","is-referenced-by-count":9,"title":["Single Depot Multiple Travelling Salesman Problem Solved With Preference-Based Stepping Ahead Firefly Algorithm"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1871-387X","authenticated-orcid":false,"given":"Ravneil","family":"Nand","sequence":"first","affiliation":[{"name":"School of Information Technology, Engineering, Mathematics and Physics, The University of the South Pacific, Suva, Fiji"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2378-7745","authenticated-orcid":false,"given":"Kaylash","family":"Chaudhary","sequence":"additional","affiliation":[{"name":"School of Information Technology, Engineering, Mathematics and Physics, The University of the South Pacific, Suva, Fiji"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7519-7712","authenticated-orcid":false,"given":"Bibhya","family":"Sharma","sequence":"additional","affiliation":[{"name":"School of Information Technology, Engineering, Mathematics and Physics, The University of the South Pacific, Suva, Fiji"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2022.101636"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.06.038"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxq015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.814902"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-022-01061-w"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2011992"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/01969722.2020.1827795"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00315"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.07.006"},{"key":"ref10","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","volume":"3","author":"Lawler","year":"1985"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00215"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-018-0621-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.09.029"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.iswa.2023.200242"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.18201\/ijisae.2019252784"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257285"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.031"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/BIMNICS.2007.4610103"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00605-5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2010.48"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2010.032124"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23857-4_38"},{"key":"ref24","volume-title":"Integer and Combinatorial Optimization","volume":"55","author":"Wolsey","year":"1999"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.16.6.B373"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1216-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.10.010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2015.127"},{"issue":"5","key":"ref29","first-page":"221","article-title":"A new method to solve the multi traveling salesman problem with the combination of genetic algorithm and clustering","volume":"17","author":"Shabanpour","year":"2017","journal-title":"IJCSNS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2705-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107517"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/847\/1\/012027"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.19"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10436672.pdf?arnumber=10436672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T22:01:36Z","timestamp":1710367296000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10436672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3366183","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}