{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:35:52Z","timestamp":1705142152400},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T00:00:00Z","timestamp":1636934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T00:00:00Z","timestamp":1636934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00831-0","type":"journal-article","created":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T12:02:43Z","timestamp":1636977763000},"page":"2996-3022","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["TLHSA and SACA: two heuristic algorithms for two variant VRP models"],"prefix":"10.1007","volume":"44","author":[{"given":"Xuhong","family":"Cai","sequence":"first","affiliation":[]},{"given":"Li","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Songhu","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,15]]},"reference":[{"key":"831_CR1","doi-asserted-by":"crossref","unstructured":"Alnahhal M , Ridwan A , Noche B (2014) In-plant milk run decision problems. In: International conference on logistics & operations management. IEEE","DOI":"10.1109\/GOL.2014.6887421"},{"key":"831_CR2","doi-asserted-by":"crossref","unstructured":"Alvarenga GB, Silva RMDA, Mateus GR (2005) A Hybrid Approach for the Dynamic Vehicle Routing Problem with Time Windows. 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 6.9 (November 2005) Rio de Janeiro. Brazil, IEEE","DOI":"10.1109\/ICHIS.2005.8"},{"key":"831_CR3","unstructured":"Ben AE, Harbaoui DI, Bouchriha H et al (2013) Optimization of the multi-depot & Multi-vehicle pickup and delivery problem with time windows using genetic algorithm. In: International conference on control. IEEE"},{"issue":"1","key":"831_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau JF, Gribkovskaia I et al (2007) Static pickup and delivery problems: aclassification scheme and survey. TOP 15(1):1\u201331","journal-title":"TOP"},{"issue":"1","key":"831_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia G, Cordeau JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8\u201315","journal-title":"Eur J Oper Res"},{"issue":"9","key":"831_CR6","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1007\/s00500-014-1574-4","volume":"19","author":"J De Armas","year":"2015","unstructured":"De Armas J, Meli\u00e1n-Batista B (2015) Constrained dynamic vehicle routing problems with time windows. Soft Comput 19(9):2481\u20132498","journal-title":"Soft Comput"},{"key":"831_CR7","doi-asserted-by":"crossref","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40","DOI":"10.1287\/opre.40.2.342"},{"key":"831_CR8","doi-asserted-by":"crossref","unstructured":"Ezzat B, Darwish S (2019) Game theory based solver for dynamic vehicle routing problem. Adv Intell Syst Comput","DOI":"10.1007\/978-3-030-14118-9_14"},{"issue":"3","key":"831_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau M et al (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp Res Part C Emerg Technol 14(3):157\u2013174","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"4","key":"831_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381\u2013390","journal-title":"Transp Sci"},{"key":"831_CR11","doi-asserted-by":"crossref","unstructured":"Gyulai D, Pfeiffer A, Sobottka T, et\u00a0al (2013) Milkrun vehicle routing approach for shop-floor logistics. Procedia Cirp, 7:127-132","DOI":"10.1016\/j.procir.2013.05.022"},{"issue":"1","key":"831_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10489-006-0033-z","volume":"27","author":"FT Hanshar","year":"2007","unstructured":"Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Appl Intell 27(1):89\u201399","journal-title":"Appl Intell"},{"issue":"2","key":"831_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cor.2011.03.006","volume":"39","author":"L Hong","year":"2012","unstructured":"Hong L (2012) An improved lns algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39(2):151\u2013163","journal-title":"Comput Oper Res"},{"key":"831_CR14","doi-asserted-by":"crossref","unstructured":"Ji-Li K , Guo-Zhu J , Cui-Ying G (2013) A new mathematical model of vehicle routing problem based on milk-run. International conference on management science & engineering. IEEE","DOI":"10.1109\/ICMSE.2013.6586310"},{"key":"831_CR15","doi-asserted-by":"publisher","unstructured":"Li H, Lim A (2001)A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings 13th IEEE international conference on tools with artificial intelligence. ICTAI 2001, Dallas, TX, USA, pp 160\u2013167. https:\/\/doi.org\/10.1109\/ICTAI.2001.974461.","DOI":"10.1109\/ICTAI.2001.974461."},{"key":"831_CR16","doi-asserted-by":"crossref","unstructured":"Ma HJ, Wei J (2013) Milk-run vehicle routing optimization model and algorithm of automobile parts. Appl Mech Mater 1463\u20131467","DOI":"10.4028\/www.scientific.net\/AMM.253-255.1463"},{"key":"831_CR17","doi-asserted-by":"crossref","unstructured":"Mei H, Jingshuai Y, Teng MA, Xiuli LI, Ting W (2017) The modeling of milk-run vehicle routing problem based on improved C-W algorithm that joined time window. Transp Res Procedia","DOI":"10.1016\/j.trpro.2017.05.453"},{"key":"831_CR18","doi-asserted-by":"crossref","unstructured":"Miao Z, Xu KL (2011) Modeling and simulation of lean supply chain with the consideration of delivery consolidation. Key Eng Mater","DOI":"10.4028\/www.scientific.net\/KEM.467-469.853"},{"issue":"8","key":"831_CR19","first-page":"685","volume":"38","author":"S Mitrovic-Minic","year":"2004","unstructured":"Mitrovic-Minic S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp Res Part B (Methodol) 38(8):685","journal-title":"Transp Res Part B (Methodol)"},{"issue":"3","key":"831_CR20","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2016.04.016","volume":"254","author":"D Mnnel","year":"2016","unstructured":"Mnnel D, Bortfeldt A (2016) A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints[J]. Eur J Oper Res 254(3):840\u2013858","journal-title":"Eur J Oper Res"},{"issue":"4","key":"831_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327\u2013343","journal-title":"J Comb Optim"},{"issue":"1\u20132","key":"831_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10479-017-2520-5","volume":"259","author":"A Montero","year":"2017","unstructured":"Montero A, Jose Miranda-Bront J, Mendez-Diaz I (2017) An ILP-based local search procedure for the VRP with pickups and deliveries. Ann Oper Res 259(1\u20132):327\u2013350","journal-title":"Ann Oper Res"},{"key":"831_CR23","doi-asserted-by":"crossref","unstructured":"Nagata Y, Kobayashi S (2010) Guided ejection search for the pickup and delivery problem with time windows. In: European conference on evolutionary computation in combinatorial optimization. Springer, Berlin","DOI":"10.1007\/978-3-642-12139-5_18"},{"key":"831_CR24","doi-asserted-by":"crossref","unstructured":"Nalepa J, Blocho M(2017) A parallel memetic algorithm for the pickup and delivery problem with time windows. In: Euromicro international conference on parallel. IEEE","DOI":"10.1109\/PDP.2017.75"},{"key":"831_CR25","doi-asserted-by":"crossref","unstructured":"Necula R, Breaban M, Raschip M (2017) Tackling dynamic vehicle routing problem with time windows by means of ant colony system. In: 2017 IEEE congress on evolutionary computation (CEC). IEEE","DOI":"10.1109\/CEC.2017.7969606"},{"key":"831_CR26","doi-asserted-by":"publisher","unstructured":"Nguyen THD, Dao T M (2015) Novel approach to optimize milk-run delivery: a case study. In: 2015 IEEE international conference on industrial engineering and engineering management (IEEM), Singapore, pp 351\u2013355, https:\/\/doi.org\/10.1109\/IEEM.2015.7385667","DOI":"10.1109\/IEEM.2015.7385667"},{"issue":"1","key":"831_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"1","key":"831_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Networks 67(1):3\u201331","journal-title":"Networks"},{"issue":"3","key":"831_CR29","first-page":"165","volume":"46","author":"V Pureza","year":"2008","unstructured":"Pureza V, Laporte G (2008) Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR Inf Syst Oper Res 46(3):165\u2013176","journal-title":"INFOR Inf Syst Oper Res"},{"key":"831_CR30","doi-asserted-by":"crossref","unstructured":"Ropke S, Pisinger D (2006) an adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40","DOI":"10.1287\/trsc.1050.0135"},{"key":"831_CR31","unstructured":"Sintef. Li and Lim benchmark, https:\/\/www.sintef.no\/projectweb\/top\/pdptw\/li-lim-benchmark\/100-customers\/"},{"key":"831_CR32","volume-title":"Ant colony optimization and constraint programming","author":"C Solnon","year":"2018","unstructured":"Solnon C (2018) Ant colony optimization and constraint programming. Wiley-IEEE Press, New York"},{"issue":"2","key":"831_CR33","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"831_CR34","doi-asserted-by":"crossref","unstructured":"Urru A, Bonini M, Echelmeyer W (2018) Planning of a milk-run systems in high constrained industrial scenarios. In: 2018 IEEE 22nd international conference on intelligent engineering systems (INES). IEEE","DOI":"10.1109\/INES.2018.8523926"},{"key":"831_CR35","doi-asserted-by":"crossref","unstructured":"Utzle T, Nez M, Pellegrini P, Maur M, de Montes O, Marco B, Mauro DM (2010). Parameter adaptation in ant colony optimization. Autonomous Search","DOI":"10.1007\/978-3-642-21434-9_8"},{"key":"831_CR36","unstructured":"Veen BV, Emmerich M, Yang Z, Baeck T, Kok JN (2013) Ant colony algorithms for the dynamic vehicle routing problem with time windows. In: IWINAC\u20135th international work conference on the interplay between natural and artificial computation. Springer, Berlin"},{"issue":"1","key":"831_CR37","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11047-016-9550-9","volume":"16","author":"Z Yang","year":"2017","unstructured":"Yang Z, Van Osta JP, Van Veen B, Van Krevelen R, Van Klaveren R, Stam A et al (2017) Dynamic vehicle routing with time windows in theory and practice. Nat Comput 16(1):119\u2013134","journal-title":"Nat Comput"},{"issue":"1","key":"831_CR38","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-017-2531-2","volume":"273","author":"B Yao","year":"2019","unstructured":"Yao B, Chen C, Song X et al (2019) Fresh seafood delivery routing problem using an improved ant colony optimization. Ann Oper Res 273(1):163\u2013186","journal-title":"Ann Oper Res"},{"key":"831_CR39","doi-asserted-by":"crossref","unstructured":"YuHsuan H, ChuanKang T (2010) Ant colony optimization for the single vehicle pickup and delivery problem with time window. In: International conference on technologies & applications of artificial intelligence. IEEE Computer Society","DOI":"10.1109\/TAAI.2010.90"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00831-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00831-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00831-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:23:17Z","timestamp":1665778997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00831-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,15]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["831"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00831-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,15]]},"assertion":[{"value":"29 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}