{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:48:33Z","timestamp":1769309313810,"version":"3.49.0"},"reference-count":30,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":54,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71371172"],"award-info":[{"award-number":["71371172"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,3,16]]},"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p>The vehicle routing problem (VRP) is a well-researched problem in the operations re- search literature. This paper studies a vehicle routing problem with time windows. Based on Solomon\u2019s research, an improved sequential initialization algorithm, Solomon i1 with DTWC (Solomon i1 with Dynamic Time Windows Compatibility), is proposed in this paper to construct feasible initial solutions with higher quality in less calculation time. A tabu search with VNS (Variable Neighborhood Search) and the Metropolis criterion is used to further optimize the solutions that the proposed initialization algorithm provides. We run computational experiments on cases of well-known problems. Results show that compared to the initialization method before the change, our improved initialization approach performs well in terms of providing a better feasible initialization solution in less time, with an average 10% improvement in solution quality and an average 34% computational time savings. The proposed initialization algorithm\u2019s superiority is also demonstrated by the tabu search\u2019s better performance on the initial solutions it produces.<\/jats:p>","DOI":"10.1051\/ro\/2024069","type":"journal-article","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T20:01:28Z","timestamp":1710878488000},"page":"1979-1999","source":"Crossref","is-referenced-by-count":5,"title":["An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6452-4802","authenticated-orcid":false,"given":"Bin","family":"Yue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junxu","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5574-706X","authenticated-orcid":false,"given":"Jinfa","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linjian","family":"Shangguan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manage. Sci."},{"key":"R2","doi-asserted-by":"crossref","first-page":"105237","DOI":"10.1016\/j.cor.2021.105237","volume":"130","author":"Ekren","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.autcon.2017.08.013","volume":"84","author":"Liu","year":"2017","journal-title":"Autom. Constr."},{"key":"R4","doi-asserted-by":"crossref","first-page":"105452","DOI":"10.1016\/j.cor.2021.105452","volume":"136","author":"Ferreira","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"R6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.20178","volume":"49","author":"Kallehauge","year":"2007","journal-title":"Networks"},{"key":"R7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.autcon.2012.11.040","volume":"31","author":"Tao","year":"2013","journal-title":"Autom. Constr."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1745","DOI":"10.4028\/www.scientific.net\/AMM.241-244.1745","volume":"241\u2013244","author":"Yan","year":"2012","journal-title":"Appl. Mech. Mater."},{"key":"R9","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1111\/mice.12020","volume":"29","author":"Lin","year":"2013","journal-title":"Comput.-Aided Civil Infrastruct. Eng."},{"key":"R10","doi-asserted-by":"crossref","first-page":"107526","DOI":"10.1016\/j.knosys.2021.107526","volume":"233","author":"Wang","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"R11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.trb.2020.12.007","volume":"145","author":"Basso","year":"2021","journal-title":"Transp. Res. Part B: Methodol."},{"key":"R12","doi-asserted-by":"crossref","first-page":"108238","DOI":"10.1016\/j.cie.2022.108238","volume":"169","author":"Ying","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"R13","doi-asserted-by":"crossref","first-page":"107478","DOI":"10.1016\/j.cie.2021.107478","volume":"159","author":"Ongcunaruk","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"R14","doi-asserted-by":"crossref","first-page":"107877","DOI":"10.1016\/j.asoc.2021.107877","volume":"113","author":"Pasandi","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"R15","doi-asserted-by":"crossref","first-page":"107403","DOI":"10.1016\/j.asoc.2021.107403","volume":"108","author":"Altabeeb","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"R16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.aej.2022.09.008","volume":"64","author":"Ahmed","year":"2023","journal-title":"Alexandria Eng. J."},{"key":"R17","doi-asserted-by":"crossref","first-page":"109239","DOI":"10.1016\/j.asoc.2022.109239","volume":"126","author":"Meliani","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"R18","doi-asserted-by":"crossref","first-page":"100911","DOI":"10.1016\/j.swevo.2021.100911","volume":"64","author":"\u0130lhan","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"R19","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"102757","DOI":"10.1016\/j.tre.2022.102757","volume":"164","author":"Masmoudi","year":"2022","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"R21","doi-asserted-by":"crossref","first-page":"107378","DOI":"10.1016\/j.knosys.2021.107378","volume":"230","author":"Niu","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"R22","doi-asserted-by":"crossref","first-page":"107887","DOI":"10.1016\/j.cie.2021.107887","volume":"164","author":"Guti\u00e9rrez-S\u00e1nchez","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"R23","doi-asserted-by":"crossref","first-page":"11939","DOI":"10.1016\/j.eswa.2011.03.088","volume":"38","author":"Pang","year":"2011","journal-title":"Expert Syst. App."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1016\/j.ejor.2021.02.027","volume":"294","author":"Chen","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"R25","doi-asserted-by":"crossref","first-page":"100884","DOI":"10.1016\/j.retrec.2020.100884","volume":"90","author":"Escudero-Santana","year":"2021","journal-title":"Res. Transp. Econ."},{"key":"R26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s13676-016-0101-4","volume":"7","author":"Errico","year":"2018","journal-title":"Eur. J. Transp. Logistics"},{"key":"R27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.ejor.2020.05.041","volume":"288","author":"Gmira","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"R28","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"Cordeau","year":"2001","journal-title":"J. Oper. Res. Soc."},{"key":"R29","doi-asserted-by":"crossref","first-page":"105205","DOI":"10.1016\/j.cor.2020.105205","volume":"129","author":"Yu","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1016\/j.ifacol.2019.11.334","volume":"52","author":"Meliani","year":"2019","journal-title":"IFAC-PapersOnLine"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024069\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T08:06:52Z","timestamp":1713946012000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":30,"journal-issue":{"issue":"2"},"alternative-id":["ro230128"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024069","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}