{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:34:23Z","timestamp":1776976463264,"version":"3.51.4"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"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":["71471092"],"award-info":[{"award-number":["71471092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LR17G010001"],"award-info":[{"award-number":["LR17G010001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ningbo Science & Technology Bureau","award":["2014A35006"],"award-info":[{"award-number":["2014A35006"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10489-018-1250-y","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T05:42:37Z","timestamp":1533793357000},"page":"4937-4959","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6540-6827","authenticated-orcid":false,"given":"Binhui","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruibin","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wasakorn","family":"Laesanklang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"issue":"1","key":"1250_CR1","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(1):80\u201391","journal-title":"Manag Sci"},{"issue":"2","key":"1250_CR2","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"},{"issue":"4","key":"1250_CR3","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472\u20131483","journal-title":"Comput Ind Eng"},{"key":"1250_CR4","doi-asserted-by":"crossref","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges. Springer Science & Business Media, vol. 43","DOI":"10.1007\/978-0-387-77778-8"},{"issue":"1","key":"1250_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00291-007-0079-2","volume":"30","author":"N Wieberneit","year":"2008","unstructured":"Wieberneit N (2008) Service network design for freight transportation: a review. OR spectrum 30(1):77\u2013112","journal-title":"OR spectrum"},{"issue":"3","key":"1250_CR6","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00291-010-0193-4","volume":"32","author":"R Zhang","year":"2010","unstructured":"Zhang R, Yun WY, Kopfer H (2010) Heuristic-based truck scheduling for inland container transportation. OR spectrum 32(3):787\u2013808","journal-title":"OR spectrum"},{"issue":"2","key":"1250_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0965-8564(00)00037-9","volume":"36","author":"X Wang","year":"2002","unstructured":"Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transp Res B Methodol 36(2):97\u2013112","journal-title":"Transp Res B Methodol"},{"key":"1250_CR8","doi-asserted-by":"crossref","unstructured":"Chen J, Bai R, Qu R, Kendall G (2013) A task based approach for a real-world commodity routing problem. In: 2013 IEEE Workshop on Computational Intelligence In Production And Logistics Systems (CIPLS) IEEE, Conference Proceedings , pp 1\u20138","DOI":"10.1109\/CIPLS.2013.6595193"},{"issue":"3","key":"1250_CR9","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.ejor.2006.02.030","volume":"183","author":"M Mourgaya","year":"2007","unstructured":"Mourgaya M, Vanderbeck F (2007) Column generation based heuristic for tactical planning in multi-period vehicle routing. Eur J Oper Res 183(3):1028\u20131041","journal-title":"Eur J Oper Res"},{"key":"1250_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tre.2016.09.004","volume":"95","author":"I Dayarian","year":"2016","unstructured":"Dayarian I, Crainic TG, Gendreau M, Rei W (2016) An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 95:95\u2013123","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"1250_CR11","unstructured":"Cordeau JF (2000) The VRP with time windows. Montr\u00e9al: Groupe d\u00e9tudes et de recherche en analyse des d\u00e9cisions"},{"issue":"1","key":"1250_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdo\u0121an","year":"2012","unstructured":"Erdo\u0121an S, Miller-Hooks E (2012) A green vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 48(1):100\u2013114","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"8","key":"1250_CR13","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1016\/j.trb.2011.02.004","volume":"45","author":"T Bektas\u0307","year":"2011","unstructured":"Bektas\u0307 T, Laporte G (2011) The pollution-routing problem. Transp Res B Methodol 45(8):1232\u20131250","journal-title":"Transp Res B Methodol"},{"key":"1250_CR14","doi-asserted-by":"crossref","unstructured":"Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, vol 74","DOI":"10.1002\/9780470496916"},{"key":"1250_CR15","unstructured":"Br\u00e4ysy O, Gendreau M (2001) Metaheuristics for the vehicle routing problem with time windows. Report STF42 A, vol. 1025, 3\u201338"},{"issue":"4-5","key":"1250_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte G, Gendreau M, Potvin J-Y, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7(4-5):285\u2013300","journal-title":"Int Trans Oper Res"},{"key":"1250_CR17","unstructured":"Aarts EH, Lenstra JK (1997) Local search in combinatorial optimization. Princeton University Press"},{"issue":"1","key":"1250_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez JAM (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367\u2013407","journal-title":"Ann Oper Res"},{"issue":"3","key":"1250_CR19","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR) 35(3):268\u2013308","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"1250_CR20","unstructured":"Gendreau M, Tarantilis CD (2010) Solving large-scale vehicle routing problems with time windows: The state-of-the-art. CIRRELT"},{"key":"1250_CR21","doi-asserted-by":"crossref","unstructured":"Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: An emerging direction in modern search technology. In: Handbook of metaheuristics. Springer, pp 457\u2013474","DOI":"10.1007\/0-306-48056-5_16"},{"issue":"1","key":"1250_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10288-011-0182-8","volume":"10","author":"R Bai","year":"2012","unstructured":"Bai R, Blazewicz J, Burke EK, Kendall G, McCollum B (2012) A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR: A Quarterly Journal of Operations Research 10(1):43\u201366","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"12","key":"1250_CR23","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724","journal-title":"J Oper Res Soc"},{"issue":"1","key":"1250_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R Qu","year":"2009","unstructured":"Qu R, Burke EK, McCollum B, Merlot LT, Lee SY (2009) A survey of search methodologies and automated system development for examination timetabling. J Sched 12(1):55\u201389","journal-title":"J Sched"},{"key":"1250_CR25","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward JR (2010) A classification of hyper-heuristic approaches. In: Handbook of metaheuristics. Springer, pp. 449\u2013468","DOI":"10.1007\/978-1-4419-1665-5_15"},{"issue":"6","key":"1250_CR26","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10732-010-9126-2","volume":"16","author":"P Garrido","year":"2010","unstructured":"Garrido P, Riff MC (2010) Dvrp: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. J Heuristics 16(6):795\u2013834","journal-title":"J Heuristics"},{"key":"1250_CR27","first-page":"4","volume":"3","author":"NR Sabar","year":"2012","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2012) Grammatical evolution hyper-heuristic for combinatorial optimization problems. strategies 3:4","journal-title":"strategies"},{"key":"1250_CR28","doi-asserted-by":"crossref","unstructured":"Walker JD, Ochoa G, Gendreau M, Burke EK (2012) Vehicle routing and adaptive iterated local search within the hyflex hyper-heuristic framework. In: LION. Springer, pp. 265\u2013276","DOI":"10.1007\/978-3-642-34413-8_19"},{"issue":"2","key":"1250_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TCYB.2014.2323936","volume":"45","author":"NR Sabar","year":"2015","unstructured":"Sabar NR, Ayob M, Kendall G, Qu R (2015) A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Transactions on Cybernetics 45(2):217\u2013228","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"3","key":"1250_CR30","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673","journal-title":"Eur J Oper Res"},{"issue":"12","key":"1250_CR31","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J-Y Potvin","year":"1995","unstructured":"Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routeing problems with time windows. J Oper Res Soc 46(12):1433\u20131446","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1250_CR32","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard \u00c9, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"},{"key":"1250_CR33","unstructured":"Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK"},{"key":"1250_CR34","unstructured":"(1998). Using constraint programming and local search methods to solve vehicle routing problems. In: International Conference on Principles and Practice of Constraint Programming. Springer, pp. 417\u2013431"},{"issue":"8","key":"1250_CR35","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34 (8):2403\u20132435","journal-title":"Comput Oper Res"},{"issue":"2","key":"1250_CR36","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf G, Schneider J, Stamm-Wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. J Comput Phys 159(2):139\u2013171","journal-title":"J Comput Phys"},{"issue":"5","key":"1250_CR37","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y Nagata","year":"2009","unstructured":"Nagata Y, Br\u00e4ysy O (2009) A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper Res Lett 37(5):333\u2013338","journal-title":"Oper Res Lett"},{"issue":"3","key":"1250_CR38","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/ijoc.1060.0186","volume":"19","author":"A Lim","year":"2007","unstructured":"Lim A, Zhang X (2007) A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS J Comput 19(3):443\u2013457","journal-title":"INFORMS J Comput"},{"key":"1250_CR39","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-01009-5_15","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Yuichi Nagata","year":"2009","unstructured":"Nagata Y, Tojo S (2009) Guided ejection search for the job shop scheduling problem. In: European Conference on Evolutionary Computation in Combinatorial Optimization. Springer. Conference Proceedings, pp. 168\u2013179"},{"key":"1250_CR40","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-12139-5_18","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Yuichi Nagata","year":"2010","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, Conference Proceedings, pp. 202\u2013213"},{"key":"1250_CR41","unstructured":"Ehrgott M (2006) Multicriteria optimization. Springer Science & Business Media"},{"key":"1250_CR42","unstructured":"Lourens T (2005) Using population-based incremental learning to optimize feasible distribution logistic solutions. Thesis"},{"key":"1250_CR43","unstructured":"Coello CAC, Lamont GB, Van Veldhuizen DA et al (2007) Evolutionary algorithms for solving multi-objective problems Springer, vol. 5"},{"issue":"4","key":"1250_CR44","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10(4):1096\u20131107","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1250_CR45","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","volume":"47","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ (2011) An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review 47(2):166\u2013181","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"1250_CR46","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez N, Semet F, Talbi E-G (2008) Multi-objective vehicle routing problems. Eur J Oper Res 189 (2):293\u2013309","journal-title":"Eur J Oper Res"},{"key":"1250_CR47","unstructured":"Maps G (2018). Google maps https:\/\/www.google.com\/maps\/d\/u\/0\/edit?hl=en&mid=1F7Ap9EO3MyzFudUQ4_Mu48ZlhSY&ll=30.08120233597248%2C117.0881652999999&z=7 , accessed: 2018-05-11"},{"issue":"2","key":"1250_CR48","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3233\/IA-160099","volume":"10","author":"L Chrpa","year":"2016","unstructured":"Chrpa L, Magazzeni D, McCabe K, McCluskey TL, Vallati M (2016) Automated planning for urban traffic control: Strategic vehicle routing to respect air quality limitations. Intelligenza Artificiale 10(2):113\u2013128","journal-title":"Intelligenza Artificiale"},{"key":"1250_CR49","unstructured":"Allard T, Gretton C (2015) A realistic multi-modal cargo routing benchmark. In: Workshops at the 29th AAAI Conference on Artificial Intelligence"},{"key":"1250_CR50","doi-asserted-by":"crossref","unstructured":"Kiesel S, Burns E, Wilt CM, Ruml W (2012) Integrating vehicle routing and motion planning. In: ICAPS","DOI":"10.1609\/icaps.v22i1.13517"},{"key":"1250_CR51","unstructured":"Chen B, Qu R, Ishibuchi H (2017) Variable-depth adaptive large neighbourhood search algorithm for open periodic vehicle routing problem with time windows. In: International Conference on Harbor, Maritime & Multimodal Logistics Modelling and Simulation (HMS 2017), Conference Proceedings, pp. 25\u201334"},{"issue":"1","key":"1250_CR52","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck G (1993) New optimization heuristics: The great deluge algorithm and the record-to-record travel. J Comput Phys 104(1):86\u201392","journal-title":"J Comput Phys"},{"key":"1250_CR53","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-53982-9_1","volume-title":"Operations Research and Enterprise Systems","author":"Binhui Chen","year":"2017","unstructured":"Chen B, Qu R, Bai R, Ishibuchi H (2016) An investigation on compound neighborhoods for vrptw. In: International Conference on Operations Research and Enterprise Systems. Springer, Cham, pp 3\u201319"},{"issue":"10","key":"1250_CR54","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. The Bell System Technical Journal 44 (10):2245\u20132269","journal-title":"The Bell System Technical Journal"},{"key":"1250_CR55","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.trb.2015.06.002","volume":"79","author":"R Bai","year":"2015","unstructured":"Bai R, Xue N, Chen J, Roberts GW (2015) A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. Transp Res B Methodol 79:134\u2013148","journal-title":"Transp Res B Methodol"},{"issue":"12","key":"1250_CR56","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TCYB.2014.2310651","volume":"44","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Diversity comparison of pareto front approximations in many-objective optimization. IEEE Transactions on Cybernetics 44(12):2568\u20132584","journal-title":"IEEE Transactions on Cybernetics"},{"key":"1250_CR57","unstructured":"Bradstreet L (2011) The hypervolume indicator for multi-objective optimisation: calculation and use. University of Western Australia"},{"key":"1250_CR58","unstructured":"Pirkwieser S, Raidl GR (2008) A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Proceedings of the 9th EU\/meeting on metaheuristics for logistics and vehicle routing. Troyes, France, pp 23\u201324"},{"issue":"3","key":"1250_CR59","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr VC, Doerner KF, Hartl RF (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3):791\u2013802","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1250_CR60","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"issue":"3","key":"1250_CR61","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/trsc.1120.0432","volume":"47","author":"R Masson","year":"2013","unstructured":"Masson R, Lehu\u00e9d\u00e9 F, P\u00e9ton O (2013) An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transp Sci 47(3):344\u2013355","journal-title":"Transp Sci"},{"key":"1250_CR62","unstructured":"SINTEF (2018) Best known solution values for solomon benchmark http:\/\/www.sintef.no\/Projectweb\/TOP\/VRPTW\/Solomon-benchmark\/100-customers\/ , accessed: 2018-05-11"},{"issue":"6","key":"1250_CR63","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","volume":"34","author":"GB Alvarenga","year":"2007","unstructured":"Alvarenga GB, Mateus GR, De Tomi G (2007) A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput Oper Res 34(6):1561\u20131584","journal-title":"Comput Oper Res"},{"issue":"1","key":"1250_CR64","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"K Tan","year":"2006","unstructured":"Tan K, Chew Y, Lee L (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34(1):115\u2013151","journal-title":"Comput Optim Appl"},{"key":"1250_CR65","doi-asserted-by":"crossref","unstructured":"K\u00fc\u00e7 \u00fcko\u011f lu \u0130, \u00d6zt\u00fcrk N (2014) An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Computers & Industrial Engineering","DOI":"10.1016\/j.cie.2014.10.014"},{"issue":"5","key":"1250_CR66","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B Kallehauge","year":"2006","unstructured":"Kallehauge B, Larsen J, Madsen OB (2006) Lagrangian duality applied to the vehicle routing problem with time windows. Comput Oper Res 33(5):1464\u20131487","journal-title":"Comput Oper Res"},{"key":"1250_CR67","unstructured":"Cook W, Rich JL (1999) A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics Department, Rice University, Houston, TX, Technical Report"},{"issue":"1","key":"1250_CR68","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24(1):17\u201330","journal-title":"Appl Intell"},{"issue":"4","key":"1250_CR69","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"W-C Chiang","year":"1997","unstructured":"Chiang W-C, Russell RA (1997) A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on computing 9(4):417\u2013430","journal-title":"INFORMS Journal on computing"},{"issue":"1","key":"1250_CR70","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard \u00c9D (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147\u2013167","journal-title":"J Heuristics"},{"issue":"8","key":"1250_CR71","doi-asserted-by":"publisher","first-page":"5375","DOI":"10.1016\/j.asoc.2011.05.021","volume":"11","author":"Z Ursani","year":"2011","unstructured":"Ursani Z, Essam D, Cornforth D, Stocker R (2011) Localized genetic algorithm for vehicle routing problem with time windows. Appl Soft Comput 11(8):5375\u20135390","journal-title":"Appl Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1250-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1250-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1250-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T07:24:22Z","timestamp":1693812262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1250-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":71,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1250"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1250-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}