{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T05:51:45Z","timestamp":1771912305810,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2022YFB4703700"],"award-info":[{"award-number":["2022YFB4703700"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52121003"],"award-info":[{"award-number":["52121003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013314","name":"Higher Education Discipline Innovation Project","doi-asserted-by":"publisher","award":["B21014"],"award-info":[{"award-number":["B21014"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s40747-024-01775-8","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T10:54:16Z","timestamp":1738234456000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A low-carbon scheduling method based on improved ant colony algorithm for underground electric transportation vehicles"],"prefix":"10.1007","volume":"11","author":[{"given":"Yizhe","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yinan","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Shirong","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,30]]},"reference":[{"issue":"S2","key":"1775_CR1","first-page":"167","volume":"39","author":"F Wang","year":"2020","unstructured":"Wang F (2020) Application of mine explosion-proof lithium-ion battery trackless rubber tyred car in underground coal mine. Shaanxi Coal 39(S2):167\u2013170 (+204)","journal-title":"Shaanxi Coal"},{"issue":"S2","key":"1775_CR2","first-page":"87","volume":"45","author":"J Xie","year":"2017","unstructured":"Xie J (2017) Application study on trackless rubber tyred vehicle with explosion proof electric in underground shendong mining area. Coal Sci Technol 45(S2):87\u201391","journal-title":"Coal Sci Technol"},{"key":"1775_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag Sci"},{"issue":"11","key":"1775_CR4","doi-asserted-by":"publisher","first-page":"4822","DOI":"10.1109\/TITS.2019.29","volume":"21","author":"J Shi","year":"2020","unstructured":"Shi J, Gao YQ, Wang W, Yu NP, Loannou PA (2020) Operating electric vehicle fleet for ride-hailing services with reinforcement learning. IEEE Trans Intell Transp Syst 21(11):4822\u20134834. https:\/\/doi.org\/10.1109\/TITS.2019.29","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1775_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105036","volume":"123","author":"M \u212bstrand","year":"2020","unstructured":"\u212bstrand M, Johansson M, Zanarini A (2020) Underground mine scheduling of mobile using constraint programming and large neighborhood search. Comput Oper Res 123:105036. https:\/\/doi.org\/10.1016\/j.cor.2020.105036","journal-title":"Comput Oper Res"},{"issue":"9","key":"1775_CR6","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1080\/17480930.2023.2236880","volume":"37","author":"M Gamache","year":"2023","unstructured":"Gamache M, Basilico G, Frayret J-M, Riopel D (2023) Real-time multi-agent fleet management strategy for autonomous underground mines vehicle. Int J Ming Reclam Environ 37(9):649\u2013666. https:\/\/doi.org\/10.1080\/17480930.2023.2236880","journal-title":"Int J Ming Reclam Environ"},{"issue":"3","key":"1775_CR7","first-page":"81","volume":"47","author":"HT Liu","year":"2019","unstructured":"Liu HT, Zhang H, Zhang XL, Han L (2019) Research and application of intelligent dispatching and management technology for coal mine trackless rubber-tyred vehicle. Coal Sci Technol 47(3):81\u201386","journal-title":"Coal Sci Technol"},{"key":"1775_CR8","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.4028\/www.scientific.net\/AMM.373-375.1525","volume":"373\u2013375","author":"F Guo","year":"2013","unstructured":"Guo F, Gao F, Ma HG, Guo S (2013) Study on trackless tyred vehicle intelligent scheduling systems base on time response. Appl Mech Mater 373\u2013375:1525\u20131528. https:\/\/doi.org\/10.4028\/www.scientific.net\/AMM.373-375.1525","journal-title":"Appl Mech Mater"},{"key":"1775_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.123025","volume":"245","author":"N Li","year":"2024","unstructured":"Li N, Wu YH, Ye HW, Wang LG, Wang QZ, Jia MT (2024) Scheduling optimization of underground mine trackless transportation based on improved estimation of distribution algorithm. Expert Syst Appl 245:123025. https:\/\/doi.org\/10.1016\/j.eswa.2023.123025","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1775_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.ejor.2004.03.008","volume":"166","author":"M Gamache","year":"2005","unstructured":"Gamache M, Grimard R, Cohen P (2005) A shortest-path algorithm for solving the fleet management problem in underground mines. Eur J Oper Res 166(2):497\u2013506. https:\/\/doi.org\/10.1016\/j.ejor.2004.03.008","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1775_CR11","doi-asserted-by":"publisher","first-page":"294","DOI":"10.3390\/electronics11030294","volume":"11","author":"H Wang","year":"2022","unstructured":"Wang H, Li GQ, Hou J, Chen LY, Hu NL (2022) A path planning method for underground intelligent vehicles based on an improved RRT* algorithm. Electronics 11(3):294. https:\/\/doi.org\/10.3390\/electronics11030294","journal-title":"Electronics"},{"issue":"6","key":"1775_CR12","doi-asserted-by":"publisher","first-page":"1606","DOI":"10.1016\/j.cor.2004.11.016","volume":"33","author":"M Beaulieu","year":"2006","unstructured":"Beaulieu M, Gamache M (2006) An enumeration algorithm for solving the fleet management problem in underground mines. Comput Oper Res 33(6):1606\u20131624. https:\/\/doi.org\/10.1016\/j.cor.2004.11.016","journal-title":"Comput Oper Res"},{"issue":"3","key":"1775_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.23919\/CSMS.2023.0011","volume":"3","author":"YN Guo","year":"2023","unstructured":"Guo YN, Huang Y, Ge SR, Zhang YZ, Jiang ES, Cheng B, Yang SX (2023) Low-carbon routing based on improved artificial bee colony algorithm for electric trackless rubber-tyred vehicles. Complex Syst Model Simul 3(3):169\u2013190. https:\/\/doi.org\/10.23919\/CSMS.2023.0011","journal-title":"Complex Syst Model Simul"},{"issue":"2","key":"1775_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror M, Trudeau P (1989) Savings by split delivery routing. Transp Sci 23(2):141\u2013145. https:\/\/doi.org\/10.1287\/trsc.23.2.141","journal-title":"Transp Sci"},{"key":"1775_CR15","doi-asserted-by":"publisher","first-page":"110336","DOI":"10.1109\/ACCESS.2020.3001590","volume":"8","author":"WZ Yang","year":"2020","unstructured":"Yang WZ, Wang D, Pang W, Tan A-H, Zhou Y (2020) Goods consumed during transit in split delivery vehicle routing problems: modeling and solution. IEEE Access 8:110336\u2013110350. https:\/\/doi.org\/10.1109\/ACCESS.2020.3001590","journal-title":"IEEE Access"},{"key":"1775_CR16","doi-asserted-by":"publisher","unstructured":"Chen RM, Guo JC (2018) Optimal routing for split delivery vehicle routing problems. In: 2018 7th international congress on advanced applied informatics (IIAI-AAI), pp 667\u2013670. https:\/\/doi.org\/10.1109\/IIAI-AAI.2018.00140","DOI":"10.1109\/IIAI-AAI.2018.00140"},{"key":"1775_CR17","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1109\/CEC45853.2021.9504873","volume":"2021","author":"WJ Ma","year":"2021","unstructured":"Ma WJ, Zhang XY, Xu YC, Gao F (2021) Loading is the key: a novel genetic quantum algorithm for SDVRP. IEEE Congr Evol Comput 2021:1817\u20131825. https:\/\/doi.org\/10.1109\/CEC45853.2021.9504873","journal-title":"IEEE Congr Evol Comput"},{"issue":"1","key":"1775_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorno A (1996) Ant system:optimization by a colony of cooperating agents. IEEE Trans SMC Part B 26(1):29\u201341. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans SMC Part B"},{"key":"1775_CR19","doi-asserted-by":"publisher","first-page":"4317","DOI":"10.1007\/s40747-022-00949-6","volume":"9","author":"HJ Liu","year":"2023","unstructured":"Liu HJ, Lee A, Lee WS, Guo P (2023) DAACO: adaptive dynamic quantity of ant ACO algorithm to solve the traveling salesman problem. Complex Intell Syst 9:4317\u20134330. https:\/\/doi.org\/10.1007\/s40747-022-00949-6","journal-title":"Complex Intell Syst"},{"issue":"10","key":"1775_CR20","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.3390\/math8101650","volume":"8","author":"ZJ Zhang","year":"2010","unstructured":"Zhang ZJ, Xu ZX, Luan SY, Li XY, Sun YF (2010) Opposition-based ant colony optimization algorithm for the traveling salesman problem. Mathematics 8(10):1650. https:\/\/doi.org\/10.3390\/math8101650","journal-title":"Mathematics"},{"key":"1775_CR21","doi-asserted-by":"publisher","first-page":"39439","DOI":"10.1109\/ACCESS.2020.2974774","volume":"8","author":"J Zheng","year":"2020","unstructured":"Zheng J (2020) A vehicle routing problem model with multiple fuzzy windows based on time-varying traffic flow. IEEE Access 8:39439\u201339444. https:\/\/doi.org\/10.1109\/ACCESS.2020.2974774","journal-title":"IEEE Access"},{"issue":"10","key":"1775_CR22","doi-asserted-by":"publisher","first-page":"10855","DOI":"10.1109\/TCYB.2021.3069942","volume":"52","author":"YH Jia","year":"2022","unstructured":"Jia YH, Mei Y, Zhang MJ (2022) A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem. IEEE Trans Cybern 52(10):10855\u201310868. https:\/\/doi.org\/10.1109\/TCYB.2021.3069942","journal-title":"IEEE Trans Cybern"},{"key":"1775_CR23","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.procs.2024.04.019","volume":"235","author":"KA Athira","year":"2024","unstructured":"Athira KA, Yalavarthi R, Saisandeep T, Harshith KSS, Sha A, Udayan D (2024) ACO-DTSP algorithm: optimizing UAV swarm routes with workload constraints. Procedia Comput Sci 235:163\u2013172. https:\/\/doi.org\/10.1016\/j.procs.2024.04.019","journal-title":"Procedia Comput Sci"},{"key":"1775_CR24","doi-asserted-by":"publisher","unstructured":"Li W, Yan WF, Huang Y (2024) Cooperative-guided ant colony optimization with knowledge learning for job shop scheduling problem. Tsinghua Sci Technol 29(5):1283\u20131299. https:\/\/doi.org\/10.26599\/TST.2023.9010098","DOI":"10.26599\/TST.2023.9010098"},{"key":"1775_CR25","doi-asserted-by":"publisher","first-page":"18866","DOI":"10.1007\/s11227-024-06235-1","volume":"80","author":"K Yesodha","year":"2024","unstructured":"Yesodha K, Krishnamurthy M, Thangaramya K, Kannan A (2024) Elliptic curve encryption-based energy-efficient secured ACO routing protocol for wireless sensor networks. J Supercomput 80:18866\u201318899. https:\/\/doi.org\/10.1007\/s11227-024-06235-1","journal-title":"J Supercomput"},{"key":"1775_CR26","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s40747-022-00833-3","volume":"9","author":"T-H Nguyen","year":"2022","unstructured":"Nguyen T-H, Jung JJ (2022) ACO-based traffic routing method with automated negotiation for connected vehicles. Complex Intell Syst 9:625\u2013636. https:\/\/doi.org\/10.1007\/s40747-022-00833-3","journal-title":"Complex Intell Syst"},{"issue":"6","key":"1775_CR27","doi-asserted-by":"publisher","first-page":"925","DOI":"10.3390\/math10060925","volume":"10","author":"SG Li","year":"2022","unstructured":"Li SG, Wei YF, Yu ZX (2022) A new fast ant colony optimization algorithm: the saltatory evolution Ant Colony Optimization Algorithm. Mathematics 10(6):925. https:\/\/doi.org\/10.3390\/math10060925","journal-title":"Mathematics"},{"issue":"3","key":"1775_CR28","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1007\/s00500-019-04053-9","volume":"24","author":"YF Wu","year":"2020","unstructured":"Wu YF, Pan F, Li SX, Chen Z, Dong M (2020) Peer-induced fairness capacitated vehicle routing scheduling using a hybrid optimization ACO\u2013VNS algorithm. Soft Comput 24(3):2201\u20132213. https:\/\/doi.org\/10.1007\/s00500-019-04053-9","journal-title":"Soft Comput"},{"key":"1775_CR29","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00500-020-05350-4","volume":"25","author":"OSJE da Silva J\u00faniorLeal","year":"2020","unstructured":"da Silva J\u00faniorLeal OSJE, Reimann M (2020) A multiple ant colony system with random variable neighborhood descent for the dynamic vehicle routing problem with time windows. Soft Comput 25:2935\u20132948. https:\/\/doi.org\/10.1007\/s00500-020-05350-4","journal-title":"Soft Comput"},{"key":"1775_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107252","volume":"156","author":"W Qin","year":"2021","unstructured":"Qin W, Zhuang ZL, Huang ZZ, Huang HZ (2021) A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem. Comput Ind Eng 156:107252. https:\/\/doi.org\/10.1016\/j.cie.2021.107252","journal-title":"Comput Ind Eng"},{"key":"1775_CR31","doi-asserted-by":"publisher","unstructured":"Sultana N, Chan J, Sarwar T, Qin AK (2021) Learning to optimise routing problems using policy optimisation. In: 2021 international joint conference on neural networks (IJCNN), pp 1\u20138. https:\/\/doi.org\/10.1109\/IJCNN52387.2021.9534010","DOI":"10.1109\/IJCNN52387.2021.9534010"},{"key":"1775_CR32","unstructured":"National Mine Safety Administration in China. Safety regulation in coal mine [DB\/OL]. http:\/\/www.mkaq.org\/html\/2016\/04\/02\/358178.shtml"},{"key":"1775_CR33","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-981-97-7184-4_2","volume":"14789","author":"B Niu","year":"2024","unstructured":"Niu B, Li WZ, Yi WJ (2024) An improved genetic algorithm for vehicle routing problem with time window requirements. advances in swarm intelligence. ICSI 2024. Lect Notes Comput Sci 14789:13\u201325. https:\/\/doi.org\/10.1007\/978-981-97-7184-4_2","journal-title":"Lect Notes Comput Sci"},{"issue":"4","key":"1775_CR34","doi-asserted-by":"publisher","first-page":"811","DOI":"10.3390\/math11040811","volume":"11","author":"SC Lo","year":"2023","unstructured":"Lo SC, Chuang YL (2023) Vehicle routing optimization with cross-docking based on an artificial immune system in logistics management. Mathematics 11(4):811. https:\/\/doi.org\/10.3390\/math11040811","journal-title":"Mathematics"},{"issue":"S1","key":"1775_CR35","first-page":"55","volume":"24","author":"WW Pan","year":"2016","unstructured":"Pan WW, Guo HX, Zhou GY, Du TS (2016) Research on split delivery and heterogeneous fleet vehicle routing problem based on two phase algorithm. Chin J Manag Sci 24(S1):55\u201361","journal-title":"Chin J Manag Sci"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01775-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01775-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01775-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T16:28:54Z","timestamp":1738945734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01775-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,30]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1775"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01775-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,30]]},"assertion":[{"value":"24 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"166"}}