{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:57:21Z","timestamp":1762253841263,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71761023"],"award-info":[{"award-number":["71761023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004775","name":"Natural Science Foundation of Gansu Province, China","doi-asserted-by":"publisher","award":["18JR3RA110"],"award-info":[{"award-number":["18JR3RA110"]}],"id":[{"id":"10.13039\/501100004775","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3093295","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T19:48:55Z","timestamp":1624996135000},"page":"101042-101051","source":"Crossref","is-referenced-by-count":7,"title":["Traveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6547-0685","authenticated-orcid":false,"given":"Xiaoxu","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Qi","family":"Song","sequence":"additional","affiliation":[]},{"given":"Song","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Zhiqiang","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Qinglei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","first-page":"1","article-title":"Model and algorithm for formulation of the single cycle crew rostering plans of high-speed railways","volume":"34","author":"chu","year":"2012","journal-title":"J China Railway Soc"},{"key":"ref30","first-page":"653","article-title":"Model and algorithm for making locomotive working diagram based on multiple traveling salesmen problem","volume":"41","author":"tao","year":"2006","journal-title":"J Southwest Jiaotong Univ"},{"key":"ref10","first-page":"1040","article-title":"A discrete state transition algorithm for travelling salesman problem","volume":"30","author":"yang","year":"2013","journal-title":"IEE Control Theory Appl"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105170"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105127","article-title":"An exact solution method for the TSP with drone based on decomposition","volume":"127","author":"v\u00e1squez","year":"2021","journal-title":"Comput Oper Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1108\/JDAL-09-2020-0018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104018"},{"key":"ref15","article-title":"A simulated annealing approach to solve a multi traveling salesman problem in a FMCG company","author":"rao","year":"2020","journal-title":"Mater Today Proc"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104061"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0826"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.01.009"},{"key":"ref19","first-page":"7","article-title":"An algorithm for multiple-bases train-set scheduling based on path-exchange","volume":"26","author":"zhao","year":"2004","journal-title":"J China Railway Soc"},{"key":"ref28","first-page":"32","article-title":"Optimization method for EMU routing scheduling based on maximum running mileage","volume":"26","author":"li","year":"2017","journal-title":"Railway Comput Appl"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcde.2018.10.004"},{"key":"ref27","first-page":"10","article-title":"Optimized decomposition algorithm for train-set scheduling of high-speed railway network","volume":"29","author":"zhong","year":"2019","journal-title":"China Safety Science Journal"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/s19081837"},{"key":"ref29","first-page":"76","article-title":"Study on optimization method for EMU-used continue network","volume":"34","author":"li","year":"2012","journal-title":"Transportation and economy of railway"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.11627\/jkise.2019.42.3.001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-019-1469-1"},{"key":"ref7","first-page":"79","article-title":"Application of two-stages genetic algorithm to solving TSP","volume":"12","author":"zhang","year":"2011","journal-title":"J PLA Univ Sci Technol Nat Sci Ed"},{"key":"ref2","first-page":"100","article-title":"Solving traveling salesman problem by chaos ant colony optimization algorithm","volume":"25","author":"gao","year":"2005","journal-title":"Systems Engineering - Theory & Practice"},{"key":"ref9","first-page":"46","article-title":"Development a new crossover scheme for traveling salesman problem by aid of genetic algorithm","volume":"11","author":"hussain","year":"2019","journal-title":"Int J Intell Syst Appl"},{"key":"ref1","first-page":"88","article-title":"Discrete particle swarm optimization algorithm for TSP problem","volume":"26","author":"zhong","year":"2006","journal-title":"Systems Engineering - Theory & Practice"},{"key":"ref20","first-page":"102","article-title":"Model and algorithm for the integrative scheduling of EMU utilization plan and maintenance plan","volume":"33","author":"wang","year":"2012","journal-title":"China Railway Sci"},{"key":"ref22","first-page":"127","article-title":"Service level oriented optimization of train operation plan for high speed railway","volume":"39","author":"shi","year":"2018","journal-title":"China Railway Sci"},{"key":"ref21","first-page":"8","article-title":"Optimized model and algorithm of motor train-sets scheduling for dedicated passenger lines","volume":"33","author":"shi","year":"2011","journal-title":"J China Railway Soc"},{"key":"ref24","first-page":"56","article-title":"Train-set operation optimization model of Wuhan–Guangzhou dedicated passenger line and its solution method","volume":"10","author":"ren","year":"2012","journal-title":"J Trans Eng Info"},{"key":"ref23","first-page":"130","article-title":"Research on the EMU operation plan based on different maintenance capacity","volume":"31","author":"zhang","year":"2010","journal-title":"China Railway Sci"},{"key":"ref26","first-page":"1","article-title":"Research on the optimization of EMU circulation based on optimized connecting network","volume":"32","author":"miao","year":"2010","journal-title":"J China Railway Soc"},{"key":"ref25","first-page":"27","article-title":"Optimum circulation model for electrical multiple units considering reliability of their operational connections","volume":"42","author":"tong","year":"2020","journal-title":"J China Railway Soc"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09467292.pdf?arnumber=9467292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:48Z","timestamp":1639771008000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9467292\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3093295","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}