{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T15:52:25Z","timestamp":1783525945761,"version":"3.55.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Key Research and Development Project of China","award":["2019YFB1600200"],"award-info":[{"award-number":["2019YFB1600200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51608171"],"award-info":[{"award-number":["51608171"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501061"],"award-info":[{"award-number":["71501061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["B200202072"],"award-info":[{"award-number":["B200202072"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3040004","type":"journal-article","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T21:01:40Z","timestamp":1606770100000},"page":"212876-212887","source":"Crossref","is-referenced-by-count":13,"title":["Region Division in Logistics Distribution With a Two-Stage Optimization Algorithm"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5933-6148","authenticated-orcid":false,"given":"Wen-Wen","family":"Qian","sequence":"first","affiliation":[{"name":"College of Civil and Transportation Engineering, Hohai University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xing","family":"Zhao","sequence":"additional","affiliation":[{"name":"College of Civil and Transportation Engineering, Hohai University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kang","family":"Ji","sequence":"additional","affiliation":[{"name":"College of Civil and Transportation Engineering, Hohai University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","first-page":"430","article-title":"Solving multiple TSP problem by K-means and crossover based modified ACO algorithm","volume":"5","author":"majd","year":"2016","journal-title":"Int J Eng Res Technol"},{"key":"ref33","first-page":"55","article-title":"Solving the multiple traveling salesman problem by a novel meta-heuristic algorithm","volume":"16","author":"larki","year":"2014","journal-title":"J Optim Ind Eng"},{"key":"ref32","first-page":"65","article-title":"Modification of the ant colony optimization for solving the multiple traveling salesman problem","volume":"16","author":"yousefikhoshbakht","year":"2013","journal-title":"Romanian J Inf Sci Technol"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30976-2_60"},{"key":"ref36","first-page":"73","article-title":"An effective genetic algorithm for solving the multiple traveling salesman problem","volume":"8","author":"sedighpour","year":"2012","journal-title":"J Optim Ind Eng"},{"key":"ref35","article-title":"Heuristic approaches for the no-depot k-traveling salesmen problem with min-max objective","author":"na","year":"2006"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","article-title":"A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem","volume":"22","author":"?aban","year":"2018","journal-title":"Soft Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2828499"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.11.048"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-018-0259-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0862"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11067-017-9367-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0741"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2014.11.043"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2705-5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.027"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.09.029"},{"key":"ref4","first-page":"173","article-title":"Road network and distribution scale constrained customer clustering algorithm in logistics distribution application","volume":"32","author":"gao","year":"2012","journal-title":"System engineering and practice"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2991\/ijcis.11.1.53"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICITEED.2018.8534753"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.02.058"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.02.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.02.018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-011-3240-7"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.10.010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.05.014"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11067-015-9297-3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12261"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.5.698"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321847"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.031"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.01.043"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09273248.pdf?arnumber=9273248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:02:43Z","timestamp":1662667363000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9273248\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3040004","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}