{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:57:14Z","timestamp":1761620234523,"version":"build-2065373602"},"reference-count":116,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780444527264"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80027-1","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"801-836","source":"Crossref","is-referenced-by-count":16,"title":["Vehicle Routing"],"prefix":"10.1016","member":"78","reference":[{"key":"10.1016\/S1574-6526(06)80027-1_bib1","series-title":"Local Search in Combinatorial Optimization","first-page":"91","article-title":"Simulated annealing","author":"Aarts","year":"1997"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib2","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/0377-2217(94)00332-7","article-title":"A new subtour elimination constraint for the vehicle routing problem","volume":"91","author":"Achuthan","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.37.2.153.15243","article-title":"An improved branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"37","author":"Achuthan","year":"2003","journal-title":"Transportation Science"},{"year":"1983","series-title":"Data Structures and Algorithms","author":"Aho","key":"10.1016\/S1574-6526(06)80027-1_bib4"},{"key":"10.1016\/S1574-6526(06)80027-1_bib5","first-page":"677","article-title":"Column generation and the airline crew pairing problem","volume":"Extra Volume ICM III","author":"Anbil","year":"1998","journal-title":"Documenta Mathematica Journal"},{"key":"10.1016\/S1574-6526(06)80027-1_bib6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02085634","article-title":"A branch-and-cut algorithm for vehicle routing problems","volume":"50","author":"Araque","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib7","series-title":"13th International Conference on Automated Planning and Scheduling ICAPS'03","article-title":"Vehicle routing and job shop scheduling: What's the difference?","author":"Beck","year":"2003"},{"key":"10.1016\/S1574-6526(06)80027-1_bib8","series-title":"Proceedings of SARA 2002, Symposium on Abstraction, Reformulation and Approximation","first-page":"282","article-title":"On the reformulation of vehicle routing problems and scheduling problems","volume":"volume 2371","author":"Beck","year":"2002"},{"key":"10.1016\/S1574-6526(06)80027-1_bib9","series-title":"Proceedings CP-AI-OR'01, Ashford 2001","article-title":"Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems","author":"Benoist","year":"2001"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/trsc.1030.0049","article-title":"A two-stage hybrid local search for the vehicle routing problem with time windows","volume":"38","author":"Bent","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S1574-6526(06)80027-1_bib11","first-page":"179","article-title":"A route-directed hybrid genetic approach for the vehicle routing problem with time windows","volume":"41","author":"Berger","year":"2003","journal-title":"INFOR"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","article-title":"A reactive variable neighborhood search for the vehicle-routing problem with time windows","volume":"15","author":"Br\u00e4ysy","year":"2003","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","article-title":"Vehicle routing problem with time windows, part I: Route construction and local search algorithms","volume":"39","author":"Br\u00e4ysy","year":"2005","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","article-title":"Vehicle routing problem with time windows, part II: Metaheuristics","volume":"39","author":"Br\u00e4ysy","year":"2005","journal-title":"Transportation Science"},{"year":"2005","series-title":"National Transportation Statistics (NTS) 2004","author":"Bureau of Transportation Statistics","key":"10.1016\/S1574-6526(06)80027-1_bib15"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib16","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","article-title":"An optimal solution procedure for the multiple tour maximum collection problem using column generation","volume":"26","author":"Butt","year":"1999","journal-title":"Computers and Operation Research"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.34.1.113.12284","article-title":"A new heuristic for the traveling salesman problem with time windows","volume":"34","author":"Calvo","year":"2000","journal-title":"Transportation Science"},{"key":"10.1016\/S1574-6526(06)80027-1_bib18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(91)90337-U","article-title":"Polyhedral results for a vehicle routing problem","volume":"52","author":"Campos","year":"1991","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib19","series-title":"Proceedings of the 14th International Conference on Logic Programming","first-page":"316","article-title":"Solving small TSPs with constraints","author":"Caseau","year":"1997"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1009661600931","article-title":"Heuristics for large constrained vehicle routing problems","volume":"5","author":"Caseau","year":"1999","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80027-1_bib21","series-title":"Proceedings, Principles and Practice of Constraint Programming \u2013 CP'99","first-page":"144","article-title":"A meta-heuristic factory for vehicle routing problems","volume":"volume 1713","author":"Caseau","year":"2004"},{"key":"10.1016\/S1574-6526(06)80027-1_bib22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","article-title":"A set partitioning heuristic for the generalised assignment problem","volume":"72","author":"Cattrysse","year":"1994","journal-title":"Europenal Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","article-title":"Simulated annealing metaheuristics to vehicle routing problems with time windows","volume":"63","author":"Chiang","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib24","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","article-title":"A reactive tabu search metaheuristic for the vehicle routing problem with time windows","volume":"9","author":"Chiang","year":"1997","journal-title":"INFORMS Journal of Computing"},{"key":"10.1016\/S1574-6526(06)80027-1_bib25","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"issue":"8","key":"10.1016\/S1574-6526(06)80027-1_bib26","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S1574-6526(06)80027-1_bib27","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","article-title":"Polyhedral study of the capacitated vehicle routing problem","volume":"60","author":"Cornu\u00e9jols","year":"1993","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib28","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0305-0548(03)00248-X","article-title":"Embedded local search approaches for routing optimization","volume":"32","author":"Cowling","year":"2005","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib29","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.1030.0051","article-title":"Meta-heuristics for a class of demand-responsive transit systems","volume":"17","author":"Crainic","year":"2005","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80027-1_bib30","series-title":"Column Generation","first-page":"99","article-title":"Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows","author":"Danna","year":"2005"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib31","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1023\/A:1009621410177","article-title":"Solving vehicle routing problems using constraint programming and metaheuristics","volume":"6","author":"De Backer","year":"2000","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80027-1_bib32","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0377-2217(97)00363-9","article-title":"Multi-depot vehicle scheduling problems with time windows and waiting costs","volume":"111","author":"Desaulniers","year":"1998","journal-title":"European Journal of Operational Research"},{"year":"2005","series-title":"Column Generation","key":"10.1016\/S1574-6526(06)80027-1_bib33"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib34","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib35","series-title":"Network Routing","first-page":"35","article-title":"Time constrained routing and scheduling","volume":"volume 8","author":"Desrosiers","year":"1995"},{"issue":"6","key":"10.1016\/S1574-6526(06)80027-1_bib36","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","article-title":"A new regret insertion heuristic for solving largescale dial-a-ride problems with time windows","volume":"38","author":"Diana","year":"2004","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib37","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/trsc.31.1.49","article-title":"A tabu search heuristic for the vehicle routing problem with backhauls and time windows","volume":"31","author":"Duhamel","year":"1997","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib38","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib39","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","article-title":"An optimal algorithm for the traveling salesman problem with time windows","volume":"43","author":"Dumas","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib40","series-title":"Practice and Theory of AutomatedTimetabling IV","first-page":"100","article-title":"Solving the travelling tournament problem: A combined integer programming and constraint programming approach","author":"Easton","year":"2003"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib41","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1013613701606","article-title":"Constraint programming based column generation for crew assignment","volume":"8","author":"Fahle","year":"2002","journal-title":"Journal of Heuristics"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib42","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","article-title":"Traveling salesman problems with profits","volume":"39","author":"Feillet","year":"2005","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib43","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","article-title":"Optimal solution of vehicle routing problems using minimum K-trees","volume":"42","author":"Fisher","year":"1994","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib44","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/opre.45.3.488","article-title":"Vehicle routing with time windows: Two optimization algorithms","volume":"45","author":"Fisher","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib45","series-title":"Logic Programming \u2014 Proceedings of the 1999 International Conference on Logic Programming","first-page":"515","article-title":"Solving TSP with time windows with constraints","author":"Focacci","year":"1999"},{"key":"10.1016\/S1574-6526(06)80027-1_bib46","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1014492408220","article-title":"Embedding relaxations in global constraints for solving TSP and TSPTW","volume":"34","author":"Focacci","year":"2002","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib47","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","article-title":"A hybrid exact algorithm for the TSPTW","volume":"14","author":"Focacci","year":"2002","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80027-1_bib48","series-title":"Handbook of Metaheuristics","first-page":"369","article-title":"Local search and constraint programming","author":"Focacci","year":"2003"},{"key":"10.1016\/S1574-6526(06)80027-1_bib49","first-page":"1","article-title":"Robust branch-and-cut-and-price for the capacitated vehicle routing problem","volume":"volume 3064","author":"Fukasawa","year":"2004"},{"issue":"6","key":"10.1016\/S1574-6526(06)80027-1_bib50","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib51","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillet","year":"1974","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib52","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib53","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search, part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"1\u20133","key":"10.1016\/S1574-6526(06)80027-1_bib54","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","article-title":"Ejection chains, reference structures and alternating path methods for traveling salesman problems","volume":"65","author":"Glover","year":"1996","journal-title":"Discrete Applied Mathematics"},{"year":"1989","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","key":"10.1016\/S1574-6526(06)80027-1_bib55"},{"year":"2002","series-title":"The Traveling Salesman Problems and its Variations","key":"10.1016\/S1574-6526(06)80027-1_bib56"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib57","article-title":"Vehicle routing software survey","volume":"31","author":"Hall","year":"2004","journal-title":"OR\/MS Today"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib58","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib59","first-page":"607","article-title":"Limited discrepancy search","volume":"volume 1","author":"Harvey","year":"1995"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib60","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ejor.2004.01.027","article-title":"A two-phase hybrid metaheuristic for the vehicle routing problem with time windows","volume":"162","author":"Homberger","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib61","unstructured":"ILOG S.A. ILOG Dispatcher 4.0 User's Manual. ILOG S.A., 9 Rue de Verdun, 94253 Gentilly Cedex, France."},{"key":"10.1016\/S1574-6526(06)80027-1_bib62","unstructured":"ILOG S.A. ILOG Solver 6.0 User's Manual. ILOG S.A., 9 Rue de Verdun, 94253 Gentilly Cedex, France."},{"issue":"5","key":"10.1016\/S1574-6526(06)80027-1_bib63","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1057\/palgrave.jors.2601113","article-title":"A greedy look-ahead heuristic for the vehicle routing problem with time windows","volume":"52","author":"Ioannou","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S1574-6526(06)80027-1_bib64","series-title":"Annotated Bibliographies in Combinatorial Optimization","article-title":"The traveling salesman problem","author":"Junger","year":"1997"},{"key":"10.1016\/S1574-6526(06)80027-1_bib65","series-title":"5th International Conference of Principles and Practice of Constraint Programming \u2014 CP'99, volume 1713 of Lecture Notes in Computer Science","first-page":"261","article-title":"A framework for constraint programming based column generation","author":"Junker","year":"2004"},{"key":"10.1016\/S1574-6526(06)80027-1_bib66","series-title":"Constraint and Integer Programming: Toward a Unified Methodology","article-title":"CP based branch and price","author":"Easton","year":"2004"},{"key":"10.1016\/S1574-6526(06)80027-1_bib67","article-title":"Lagrangean duality applied on vehicle routing with time windows","author":"Kallehauge","year":"2001","journal-title":"Technical Report IMM-TR-2001-9, IMM, Technical University of Denmark, DK-2800 Kgs. Lyngby \u2013 Denmark"},{"article-title":"Dynamic VRPs: A study of scenarios","year":"1998","author":"Kilby","key":"10.1016\/S1574-6526(06)80027-1_bib68"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib69","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1009808327381","article-title":"A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints","volume":"5","author":"Kilby","year":"2000","journal-title":"Constraints"},{"year":"2002","series-title":"Combinatorial Optimization: Theory and Algorithms, volume 21 of Algorithms and Combinatorics","author":"Korte","key":"10.1016\/S1574-6526(06)80027-1_bib70"},{"key":"10.1016\/S1574-6526(06)80027-1_bib71","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S1574-6526(06)80027-1_bib72","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib73","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib74","first-page":"271","article-title":"Comb inequalities for the vehicle routing problem","volume":"51","author":"Laporte","year":"1984","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib75","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing with capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"issue":"4\u20135","key":"10.1016\/S1574-6526(06)80027-1_bib76","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","article-title":"Classical and modern heuristics for the vehicle routing problem","volume":"7","author":"Laporte","year":"2000","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib77","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1287\/trsc.1030.0070","article-title":"The a priori dynamic traveling salesman problem with time windows","volume":"38","author":"Larsen","year":"2004","journal-title":"Transportation Science"},{"year":"1985","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","key":"10.1016\/S1574-6526(06)80027-1_bib78"},{"issue":"7","key":"10.1016\/S1574-6526(06)80027-1_bib79","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","article-title":"A cooperative parallel meta-heuristic for the vehicle routing problem with time windows","volume":"32","author":"Le Bouthillier","year":"2005","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib80","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","article-title":"Projection results for vehicle routing","volume":"105","author":"Letchford","year":"2006","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80027-1_bib81","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Systems Technical Journal"},{"key":"10.1016\/S1574-6526(06)80027-1_bib82","series-title":"ECAI Workshop on \u201cModelling and Solving Problems with Constraints\u201d (14th European Conference on Artificial Intelligence, ECAI 2000)","article-title":"Large neighbourhood search using constraint propagation and greedy reconstruction for valued CSP resolution","author":"Lobjois","year":"2000"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib83","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/trsc.1030.0040","article-title":"An exact algorithm for the multiple vehicle pickup and delivery problem","volume":"38","author":"Lu","year":"2004","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib84","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","article-title":"A new branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"100","author":"Lysgaard","year":"2004","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1574-6526(06)80027-1_bib85","series-title":"Vehicle Routing, volume 9 of SIAM Monographs on Discrete Mathematics and Applications","article-title":"Branch and cut","author":"Naddef","year":"2000"},{"key":"10.1016\/S1574-6526(06)80027-1_bib86","article-title":"Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood-Banking","author":"Or","year":"1976","journal-title":"PhD thesis, Department of Industrial Engineering and Management Sciences, Northwest University, Evanston, IL."},{"key":"10.1016\/S1574-6526(06)80027-1_bib87","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib88","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/S1574-6526(06)80027-1_bib89","series-title":"Principles and Practice of Constraint Programming \u2014 CP96, volume 1118 of Lecture Notes in Computer Science","first-page":"353","article-title":"A view of local search in constraint programming","author":"Pesant","year":"1996"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib90","doi-asserted-by":"crossref","DOI":"10.1287\/trsc.32.1.12","article-title":"An exact constraint logic programming algorithm for the travelling salesman with time windows","volume":"32","author":"Pesant","year":"1998","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib91","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0377-2217(98)00248-3","article-title":"On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem","volume":"117","author":"Pesant","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S1574-6526(06)80027-1_bib92","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","article-title":"A variable neighborhood search for the multi depot vehicle routing problem with time windows","volume":"10","author":"Polacek","year":"2004","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80027-1_bib93","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","article-title":"A parallel route building algorithm for the vehicle routing and scheduling problem with time windows","volume":"66","author":"Potvin","year":"1993","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib94","series-title":"Proceedings of Advanced Software Technology in Air Transport ASTAIR'92","article-title":"Object oriented constraint programming for transportation problems","author":"Puget","year":"1992"},{"key":"10.1016\/S1574-6526(06)80027-1_bib95","series-title":"Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Volume 1","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","author":"Regin","year":"1994"},{"key":"10.1016\/S1574-6526(06)80027-1_bib96","series-title":"Metaheuristics: Theory and Applications","article-title":"Parallel tabu search heuristic based on ejection chains for the vehicle routing problem","author":"Rego","year":"1996"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib97","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","article-title":"A column generation approach to the multiple-depot vehicle scheduling problem","volume":"42","author":"Ribeiro","year":"1994","journal-title":"Operations research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib98","unstructured":"S. Ropke and D. Pisinger. A unified heuristic for vehicle routing problems with backhauls. European Journal of Operational Research. To appear."},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib99","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1013661617536","article-title":"Using constraint-based operators to solve the vehicle routing problem with time windows","volume":"8","author":"Rousseau","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80027-1_bib100","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","article-title":"Solving VRPTWs with constraint programming based column generation","volume":"130","author":"Rousseau","year":"2004","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib101","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/0377-2217(88)90233-0","article-title":"On the integer properties of scheduling set partitioning models","volume":"35","author":"Ryan","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib102","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","article-title":"Local search in routing problems with time windows","volume":"4","author":"Savelsbergh","year":"1985","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/S1574-6526(06)80027-1_bib103","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","article-title":"The vehicle routing problem with time windows: Minimizing route duration","volume":"4","author":"Savelsbergh","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80027-1_bib104","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1023\/A:1018948011707","article-title":"A parallel algorithm for the vehicle routing problem with time window constraints","volume":"86","author":"Schulze","year":"1999","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S1574-6526(06)80027-1_bib105","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1021105422248","article-title":"Crew assignment via constraint programming: Integrating column generation and heuristic tree search","volume":"115","author":"Sellmann","year":"2002","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib106","series-title":"Fourth International Conference on Principles and Practice of Constraint Programming (CP '98)","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"key":"10.1016\/S1574-6526(06)80027-1_bib107","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problem with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib108","series-title":"Hybrid Metaheuristics, volume 3636 of Lecture Notes in Computer Science","first-page":"78","article-title":"Fast ejection chain algorithms for vehicle routing with time windows","author":"Sontrop","year":"2005"},{"key":"10.1016\/S1574-6526(06)80027-1_bib109","article-title":"A new neighbourhood structure for the vehicle routing problem with time windows","author":"Taillard","year":"1995","journal-title":"Technical Report CRT-95-66, Centre de Recherche sur les Transports, University of Montreal"},{"key":"10.1016\/S1574-6526(06)80027-1_bib110","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"year":"2002","series-title":"The Vehicle Routing Problem, volume 9 of SIAM Monographs on Discrete Mathematics and Applications","key":"10.1016\/S1574-6526(06)80027-1_bib111"},{"issue":"4","key":"10.1016\/S1574-6526(06)80027-1_bib112","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","article-title":"The granular tabu search and its application to the vehicle-routing problem","volume":"15","author":"Toth","year":"2003","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib113","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/0377-2217(94)00064-J","article-title":"Improvement heuristics for the vehicle routing problem based on simulated annealing","volume":"86","author":"Van Breedam","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80027-1_bib114","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","article-title":"A generic arc consistency algorithm and its specializations","volume":"57","author":"Van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"article-title":"Integer and Combinatorial Optimization","year":"1999","author":"Wolsey","key":"10.1016\/S1574-6526(06)80027-1_bib115"},{"issue":"3","key":"10.1016\/S1574-6526(06)80027-1_bib116","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","article-title":"Solving a practical pickup and delivery problem","volume":"37","author":"Xu","year":"2003","journal-title":"Transportation Science"}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:52:52Z","timestamp":1761619972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652606800271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":116,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80027-1","relation":{},"ISSN":["1574-6526"],"issn-type":[{"type":"print","value":"1574-6526"}],"subject":[],"published":{"date-parts":[[2006]]}}}