{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:38:18Z","timestamp":1780601898087,"version":"3.54.1"},"reference-count":269,"publisher":"Elsevier","isbn-type":[{"value":"9780444513465","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1016\/s0927-0507(06)14006-2","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T14:23:13Z","timestamp":1164637393000},"page":"367-428","source":"Crossref","is-referenced-by-count":235,"title":["Chapter 6 Vehicle Routing"],"prefix":"10.1016","author":[{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin W.P.","family":"Savelsbergh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Vigo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0927-0507(06)14006-2_bib001","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib002","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib003","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/msom.5.4.348.24884","article-title":"Price-directed replenishment of subsets: Methodology and its application to inventory routing","volume":"5","author":"Adelman","year":"2003","journal-title":"Manufacturing & Service Operations Management"},{"key":"10.1016\/S0927-0507(06)14006-2_bib004","doi-asserted-by":"crossref","unstructured":"Adelman, D. (2003b). Internal transfer pricing for a decentralized operation with a shared supplier. Working paper, Graduate School of Business, The University of Chicago","DOI":"10.2139\/ssrn.3412411"},{"key":"10.1016\/S0927-0507(06)14006-2_bib005","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1287\/opre.1040.0114","article-title":"A price-directed approach to stochastic inventory\/routing","volume":"52","author":"Adelman","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib006","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1002\/net.3230190702","article-title":"A set-partitioning-based exact algorithm for the vehicle routing problem","volume":"19","author":"Agarwal","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib007","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.39.3.456","article-title":"Parallel savings based heuristic for the delivery problem","volume":"39","author":"Altinkemer","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib008","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/mnsc.36.1.92","article-title":"One warehouse multiple retailer systems with vehicle routing costs","volume":"36","author":"Anily","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib009","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1287\/mnsc.37.11.1497","article-title":"Rejoinder to \u201cOne warehouse multiple retailer systems with vehicle routing costs\u201d","volume":"37","author":"Anily","year":"1991","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib010","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/opre.41.1.37","article-title":"Two-echelon distribution systems with vehicle routing costs and central inventories","volume":"41","author":"Anily","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib011","unstructured":"Araque, J.R., Hall, L., Magnanti, T.L. (1990). Capacitated trees, capacitated routing and associated polyhedra. Discussion Paper 90-61, CORE, University of Louvain-la-Neuve, Belgium"},{"key":"10.1016\/S0927-0507(06)14006-2_bib012","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\/S0927-0507(06)14006-2_bib013","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corber\u00e1n, A., Naddef, D., Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report RR 949-M, Universit\u00e9 Joseph Fourier, Grenoble"},{"key":"10.1016\/S0927-0507(06)14006-2_bib014","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","article-title":"Separating capacity inequalities in the CVRP using tabu search","volume":"106","author":"Augerat","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib015","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","article-title":"A parallel tabu search heuristic for the vehicle routing problem with time windows","volume":"5","author":"Badeau","year":"1997","journal-title":"Transportation Research C"},{"key":"10.1016\/S0927-0507(06)14006-2_bib016","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/01966324.1986.10737197","article-title":"Computational experience with branch exchange heuristics for vehicle routing problems with time window constraints","volume":"6","author":"Baker","year":"1986","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0927-0507(06)14006-2_bib017","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/opre.1040.0111","article-title":"An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation","volume":"52","author":"Baldacci","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib018","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1016\/j.cor.2005.02.023","article-title":"The multiple disposal facilities and multiple inventory locations rollon\u2013rolloff vehicle routing problem","volume":"33","author":"Baldacci","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib019","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","article-title":"On an integer program for a delivery problem","volume":"12","author":"Balinski","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib020","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1080\/07408179808966528","article-title":"A branch and cut algorithm for the VRP with satellite facilities","volume":"30","author":"Bard","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0927-0507(06)14006-2_bib021","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/trsc.32.2.189","article-title":"A decomposition approach to the inventory routing problem with satellite facilities","volume":"32","author":"Bard","year":"1998","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib022","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","article-title":"A branch-and-cut procedure for the vehicle routing problem with time windows","volume":"36","author":"Bard","year":"2002","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib023","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(96)00188-9","article-title":"Direct shipping and the dynamic single-depot\/multi-retailer inventory system","volume":"101","author":"Barnes-Schuster","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib024","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(82)90012-8","article-title":"An NlogN planar traveling salesman heuristic based on spacefilling curves","volume":"1","author":"Bartholdi","year":"1982","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/S0927-0507(06)14006-2_bib025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/inte.13.3.1","article-title":"A minimal technology routing system for meals on wheels","volume":"13","author":"Bartholdi","year":"1983","journal-title":"Interfaces"},{"key":"10.1016\/S0927-0507(06)14006-2_bib026","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0377-2217(92)90323-2","article-title":"The stochastic vehicle routing problem revisited","volume":"56","author":"Bastian","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib027","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","article-title":"The reactive tabu search","volume":"6","author":"Battiti","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib028","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for the sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib029","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","article-title":"Route-first cluster-second methods for vehicle routing","volume":"11","author":"Beasley","year":"1983","journal-title":"Omega"},{"issue":"6","key":"10.1016\/S0927-0507(06)14006-2_bib030","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/inte.13.6.4","article-title":"Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer","volume":"13","author":"Bell","year":"1983","journal-title":"Interfaces"},{"key":"10.1016\/S0927-0507(06)14006-2_bib031","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0927-0507(06)14006-2_bib032","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\/S0927-0507(06)14006-2_bib033","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/0305-0548(92)90006-Q","article-title":"The vehicle scheduling problem with intermittent customer demands","volume":"19","author":"Benton","year":"1992","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib034","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.20063","article-title":"Efficient neighbourhood search for the probabilistic pickup and delivery travelling salesman problem","volume":"46","author":"Beraldi","year":"2005","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib035","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1057\/palgrave.jors.2601635","article-title":"A new hybrid genetic algorithm for the capacitated vehicle routing problem","volume":"54","author":"Berger","year":"2004","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib036","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib037","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.36.1.119.573","article-title":"Deterministic order-up-to level policies in an inventory routing problem","volume":"36","author":"Bertazzi","year":"2002","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib038","series-title":"Dynamic Programming and Optimal Control","author":"Bertsekas","year":"1995"},{"key":"10.1016\/S0927-0507(06)14006-2_bib039","unstructured":"Bertsimas, D.J. (1988). Probabilistic combinatorial optimization problems. PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA"},{"key":"10.1016\/S0927-0507(06)14006-2_bib040","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1287\/opre.40.3.574","article-title":"A vehicle routing problem with stochastic demand","volume":"40","author":"Bertsimas","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib041","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(93)90145-D","article-title":"Further results on the probabilistic traveling salesman problem","volume":"65","author":"Bertsimas","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib042","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.44.2.286","article-title":"A new generation of vehicle routing research: Robust algorithms addressing uncertainty","volume":"44","author":"Bertsimas","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib043","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","article-title":"A priori optimisation","volume":"38","author":"Bertsimas","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib044","author":"Blasum"},{"key":"10.1016\/S0927-0507(06)14006-2_bib045","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/S0377-2217(01)00380-0","article-title":"A tabu search algorithm and adaptive memory procedure for political districting","volume":"144","author":"Bozkaya","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib046","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/opre.43.4.649","article-title":"A location based heuristic for general routing problems","volume":"43","author":"Bramel","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib047","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/opre.45.2.295","article-title":"On the effectiveness of set covering formulations for the vehicle routing problem with time windows","volume":"45","author":"Bramel","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib048","series-title":"The Vehicle Routing Problem","first-page":"85","article-title":"Set-covering-based algorithms for the capacitated VRP","author":"Bramel","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib049","series-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"19","article-title":"Metaheuristic for the vehicle routing problem with time windows","author":"Brand\u00e3o","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib050","first-page":"319","article-title":"Fast local searches for the vehicle routing problem with time windows","volume":"40","author":"Br\u00e4ysy","year":"2002","journal-title":"INFOR"},{"key":"10.1016\/S0927-0507(06)14006-2_bib051","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib052","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib053","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib054","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.33.3.469","article-title":"Distribution strategies that minimize transportation and inventory costs","volume":"33","author":"Burns","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib055","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/trsc.1030.0042","article-title":"Delivery volume optimization","volume":"38","author":"Campbell","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib056","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/trsc.1030.0054","article-title":"A decomposition approach for the inventory-routing problem","volume":"38","author":"Campbell","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib057","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1287\/trsc.1030.0046","article-title":"Efficient insertion heuristics for vehicle routing and scheduling problems","volume":"38","author":"Campbell","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib058","series-title":"Fleet Management and Logistics","first-page":"95","article-title":"The inventory routing problem","author":"Campbell","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib059","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 Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib060","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1287\/opre.37.5.819","article-title":"Generalized dynamic programming for stochastic combinatorial optimization","volume":"37","author":"Carraway","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib061","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/mnsc.46.2.217.11923","article-title":"Stock replenishment and shipment scheduling for vendor managed inventory systems","volume":"46","author":"\u00c7etinkaya","year":"2000","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib062","doi-asserted-by":"crossref","first-page":"2972","DOI":"10.1016\/j.cor.2005.02.029","article-title":"Vehicle routing problem with elementary shortest path based column generation","volume":"33","author":"Chabrier","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib063","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1287\/opre.46.1.96","article-title":"Probabilistic analyses and practical algorithms for inventory-routing models","volume":"46","author":"Chan","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib064","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 on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib065","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/trsc.23.2.67","article-title":"An integrated inventory allocation and vehicle routing problem","volume":"23","author":"Chien","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib066","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.33.1.3","article-title":"Decomposition of a combined inventory and time constrained ship routing problem","volume":"33","author":"Christiansen","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib067","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1018921527269","article-title":"A method for solving ship routing problems with inventory constraints","volume":"81","author":"Christiansen","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib068","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1018979107222","article-title":"Modelling path flows for a combined ship routing and inventory management problem","volume":"82","author":"Christiansen","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib069","series-title":"Logistics: Where Ends Have to Meet","first-page":"30","article-title":"Vehicle routing: Practical and algorithmic aspects","author":"Christofides","year":"1989"},{"key":"10.1016\/S0927-0507(06)14006-2_bib070","series-title":"Combinatorial Optimization","first-page":"315","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0927-0507(06)14006-2_bib071","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","article-title":"Exact algorithms for the vehicle routing problem based on the spanning tree and shortest path relaxations","volume":"20","author":"Christofides","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14006-2_bib072","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","article-title":"State-space relaxation procedures for the computation of bounds to routing problems","volume":"11","author":"Christofides","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib073","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib074","unstructured":"Cook, W., Rich, J.L. (1999). A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical Report TR99-04, Computational and Applied Mathematics Department, Rice University, TX"},{"key":"10.1016\/S0927-0507(06)14006-2_bib075","first-page":"292","article-title":"A tabu search algorithm for the site dependent vehicle routing problem with time windows","volume":"39","author":"Cordeau","year":"2001","journal-title":"INFOR"},{"key":"10.1016\/S0927-0507(06)14006-2_bib076","series-title":"Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search","first-page":"145","article-title":"Tabu search heuristics for the vehicle routing problem","author":"Cordeau","year":"2004"},{"key":"10.1016\/S0927-0507(06)14006-2_bib077","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib078","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\/S0927-0507(06)14006-2_bib079","series-title":"The Vehicle Routing Problem","first-page":"157","article-title":"VRP with Time Windows","author":"Cordeau","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib080","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","article-title":"A guide to vehicle routing heuristics","volume":"53","author":"Cordeau","year":"2002","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib081","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","article-title":"An improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows","volume":"55","author":"Cordeau","year":"2004","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib082","series-title":"Logistics Systems: Design and Optimization","first-page":"279","article-title":"New heuristics for the vehicle routing problem","author":"Cordeau","year":"2005"},{"key":"10.1016\/S0927-0507(06)14006-2_bib083","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1011301019184","article-title":"A heuristic for the vehicle routing problem with time windows","volume":"7","author":"Cordone","year":"2001","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib084","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib085","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib086","unstructured":"Danna, E., Le Pape, C. (2003). Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. Technical Report 03-006, ILOG"},{"key":"10.1016\/S0927-0507(06)14006-2_bib087","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib088","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programming","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib089","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\/S0927-0507(06)14006-2_bib090","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","article-title":"Algorithms and codes for dense assignment problems: The state of the art","volume":"100","author":"Dell'Amico","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib091","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0927-0507(06)14006-2_bib092","first-page":"191","article-title":"A generalized permanent labeling algorithm for the shortest path problem with time windows","volume":"26","author":"Desrochers","year":"1988","journal-title":"INFOR"},{"key":"10.1016\/S0927-0507(06)14006-2_bib093","unstructured":"Desrochers, M., Verhoog, T.W. (1989). A matching based savings algorithm for the vehicle routing problem. Les Cahiers du GERAD G\u201389\u201304, HEC Montr\u00e9al"},{"key":"10.1016\/S0927-0507(06)14006-2_bib094","series-title":"Vehicle Routing: Methods and Studies","first-page":"65","article-title":"Vehicle routing with time windows: Optimization and approximation","author":"Desrochers","year":"1988"},{"key":"10.1016\/S0927-0507(06)14006-2_bib095","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\/S0927-0507(06)14006-2_bib096","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"key":"10.1016\/S0927-0507(06)14006-2_bib097","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1287\/ijoc.15.3.320.16076","article-title":"A new genetic algorithm for the quadratic assignment problem","volume":"15","author":"Drezner","year":"2003","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib098","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1002\/1520-6750(198712)34:6<891::AID-NAV3220340613>3.0.CO;2-J","article-title":"Inventory\/routing: Reduction from an annual to a short period problem","volume":"34","author":"Dror","year":"1987","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0927-0507(06)14006-2_bib099","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0377-2217(86)90242-0","article-title":"Stochastic vehicle routing with modified savings algorithm","volume":"23","author":"Dror","year":"1986","journal-title":"European Journal of Operational Reserach"},{"key":"10.1016\/S0927-0507(06)14006-2_bib100","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02022035","article-title":"A computational comparison of algorithms for the inventory routing problem","volume":"4","author":"Dror","year":"1985","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib101","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/trsc.23.3.166","article-title":"Vehicle routing with stochastic demands: Properties and solution frameworks","volume":"23","author":"Dror","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib102","first-page":"273","article-title":"Vehicle routing with stochastic demands and restricted failures","volume":"37","author":"Dror","year":"1993","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib103","unstructured":"Dueck, G. (1990). New optimization heuristics, the great deluge algorithm and the record-to-record travel. Technical report, IBM Germany, Heidelberg Scientific Center"},{"key":"10.1016\/S0927-0507(06)14006-2_bib104","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics: The great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib105","doi-asserted-by":"crossref","unstructured":"Ergun, \u00d6., Orlin, J.B., Steele-Feldman, A. (2003). Creating very large scale neighborhoods out of smaller ones by compounding moves: A study on the vehicle routing problem. MIT Sloan working Paper 4393-02, Massachusetts Institute of Technology, Cambridge, MA","DOI":"10.2139\/ssrn.349701"},{"key":"10.1016\/S0927-0507(06)14006-2_bib106","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.32.5.1019","article-title":"A combined vehicle routing and inventory allocation problem","volume":"32","author":"Federgruen","year":"1984","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib107","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib108","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.42.5.846","article-title":"A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs","volume":"42","author":"Fischetti","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib109","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib110","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for the vehicle routing problem","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib111","unstructured":"Fisher, M.L., Greenfield, A., Jaikumar, R., Kedia, P. (1982). Real-time scheduling of a bulk delivery fleet: Practical application of Lagrangean relaxation. Technical report, The Wharton School, University of Pennsylvania"},{"key":"10.1016\/S0927-0507(06)14006-2_bib112","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/opre.45.3.488","article-title":"Vehicle routing with time windows \u2013 two optimization algorithms","volume":"45","author":"Fisher","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib113","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","article-title":"The travelling salesman problem","volume":"4","author":"Flood","year":"1956","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib114","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1976.63","article-title":"An integer programming approach to the vehicle scheduling problem","volume":"27","author":"Foster","year":"1976","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib115","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","article-title":"Robust branch-and-cut-and-price for the capacitated vehicle routing problem","volume":"106","author":"Fukasawa","year":"2006","journal-title":"Mathematical Programming A"},{"key":"10.1016\/S0927-0507(06)14006-2_bib116","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/mnsc.36.2.240","article-title":"On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer r-systems","volume":"36","author":"Gallego","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib117","series-title":"New Ideas in Optimization","first-page":"63","article-title":"MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows","author":"Gambardella","year":"1999"},{"key":"10.1016\/S0927-0507(06)14006-2_bib118","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1287\/opre.1040.0150","article-title":"A periodic inventory routing problem at a supermarket chain","volume":"52","author":"Gaur","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib119","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1015053600842","article-title":"Parallelization of a two-phase metaheuristic for routing problems with time windows","volume":"8","author":"Gehring","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib120","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and post-optimization procedures for the traveling selesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib121","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib122","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/trsc.29.2.143","article-title":"An exact algorithm for the vehicle routing problem with stochastic customers and demands","volume":"29","author":"Gendreau","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib123","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.44.3.469","article-title":"A tabu search algorithm for the vehicle routing problem with stochastic demands and customers","volume":"44","author":"Gendreau","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib124","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","article-title":"A generalized insertion heuristic for the traveling salesman problem with time windows","volume":"43","author":"Gendreau","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib125","series-title":"The Vehicle Routing Problem","first-page":"129","article-title":"Metaheuristics for the capacitated VRP","author":"Gendreau","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib126","unstructured":"Ghaziri, H. (1993). Algorithmes connexionistes pour l'optimisation combinatoire. Th\u00e8se de doctorat, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland"},{"key":"10.1016\/S0927-0507(06)14006-2_bib127","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/opre.1050.0218","article-title":"The black and white traveling salesman problem","volume":"54","author":"Ghiani","year":"2006","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib128","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":"21","author":"Gillett","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib129","series-title":"Computer Science and Operations Research: New Developments in Their Interfaces","first-page":"449","article-title":"New ejection chain and alternating path methods for traveling salesman problems","author":"Glover","year":"1992"},{"key":"10.1016\/S0927-0507(06)14006-2_bib130","unstructured":"Golden, B.L., Stewart, W.R. (1978). Vehicle routing with probabilistic demands. In: Hogben, D., Fife, D. (Eds.) Computer Science and Statistics: Tenth Annual Symposium on the Interface. NBS Special Publication, vol. 503, pp. 252\u2013259"},{"key":"10.1016\/S0927-0507(06)14006-2_bib131","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib132","first-page":"181","article-title":"Analysis of a large scale vehicle routing problem with an inventory component","volume":"7","author":"Golden","year":"1984","journal-title":"Large Scale Systems"},{"key":"10.1016\/S0927-0507(06)14006-2_bib133","series-title":"Fleet Management and Logistics","first-page":"33","article-title":"Metaheuristics in vehicle routing","author":"Golden","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib134","series-title":"The Vehicle Routing Problem","first-page":"245","article-title":"Routing vehicles in the real world: Applications in the solid waste, beverage, food, dairy, and newspaper industries","author":"Golden","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib135","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","article-title":"A result on projection for the vehicle routing problem","volume":"85","author":"Gouveia","year":"1995","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib136","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02098280","article-title":"A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations","volume":"61","author":"Hadjiconstantinou","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib137","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","article-title":"Bounds and heuristics for capacitated routing problems","volume":"10","author":"Haimovich","year":"1985","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib138","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/S0191-2615(98)00017-4","article-title":"The performance of route modification and demand stabilization strategies in stochastic vehicle routing","volume":"32","author":"Haughton","year":"1998","journal-title":"Transportation Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib139","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1057\/palgrave.jors.2600884","article-title":"Quantifying the benefits of route reoptimisation under stochastic customer demands","volume":"51","author":"Haughton","year":"2000","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib140","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14006-2_bib141","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of the subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14006-2_bib142","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/opre.45.1.102","article-title":"Heuristics for a one-warehouse multiretailer distribution problem with performance bounds","volume":"45","author":"Herer","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib143","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1023\/A:1018995927636","article-title":"New optimality cuts for a single-vehicle stochastic routing problem","volume":"86","author":"Hjorring","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib144","first-page":"297","article-title":"Two evolutionary metaheuristics for the vehicle routing problem with time windows","volume":"37","author":"Homberger","year":"1999","journal-title":"INFOR"},{"key":"10.1016\/S0927-0507(06)14006-2_bib145","first-page":"93","article-title":"The traveling salesman problem as a constrained shortest path problem: Theory and computational experience","volume":"17","author":"Houck","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/S0927-0507(06)14006-2_bib146","doi-asserted-by":"crossref","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Laporte, G. (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science, in press","DOI":"10.1287\/trsc.1060.0166"},{"key":"10.1016\/S0927-0507(06)14006-2_bib147","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\/S0927-0507(06)14006-2_bib148","unstructured":"Irnich, S., Villeneuve, D. (2003). The shortest path problem with resource constraints and k-cycle elimination for k\u2a7e3. Technical report, Rheinisch-Westf\u00e4lische Technische Hochschule, Aachen, Germany"},{"key":"10.1016\/S0927-0507(06)14006-2_bib149","unstructured":"Jaillet, P. (1985). Probabilistic traveling salesman problem. PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA"},{"key":"10.1016\/S0927-0507(06)14006-2_bib150","series-title":"Stochastics in Combinatorial Optimization","first-page":"197","article-title":"Stochastic routing problems","author":"Jaillet","year":"1987"},{"key":"10.1016\/S0927-0507(06)14006-2_bib151","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1287\/opre.36.6.929","article-title":"A priori solution of a traveling salesman problem in which a random subset of the customers are visited","volume":"36","author":"Jaillet","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib152","series-title":"Vehicle Routing: Methods and Studies","first-page":"293","article-title":"The probabilistic vehicle routing problem","author":"Jaillet","year":"1988"},{"key":"10.1016\/S0927-0507(06)14006-2_bib153","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.36.3.292.7829","article-title":"Delivery cost approximations for inventory routing problems in a rolling horizon framework","volume":"3","author":"Jaillet","year":"2002","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib154","unstructured":"J\u00e9z\u00e9quel, A. (1985). Probabilistic vehicle routing problems. MSc dissertation, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA"},{"key":"10.1016\/S0927-0507(06)14006-2_bib155","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","article-title":"Lagrangean duality applied to the vehicle routing with time windows","volume":"33","author":"Kallehauge","year":"2006","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib156","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1287\/opre.26.6.1033","article-title":"A preference order dynamic program for a stochastic traveling salesman problem","volume":"26","author":"Kao","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib157","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.37.1.69.12820","article-title":"Stochastic vehicle routing with random travel times","volume":"37","author":"Kenyon","year":"2003","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib158","series-title":"Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimisation","first-page":"473","article-title":"Guided local search for the vehicle routing problem with time windows","author":"Kilby","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib159","series-title":"Local Search in Combinatorial Optimization","first-page":"337","article-title":"Vehicle routing: Handling edge exchanges","author":"Kindervater","year":"1997"},{"key":"10.1016\/S0927-0507(06)14006-2_bib160","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/trsc.36.1.94.574","article-title":"The stochastic inventory routing problem with direct deliveries","volume":"36","author":"Kleywegt","year":"2002","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib161","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/trsc.1030.0041","article-title":"Dynamic programming approximations for a stochastic inventory routing problem","volume":"38","author":"Kleywegt","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib162","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","article-title":"An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation","volume":"45","author":"Kohl","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib163","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","article-title":"2-path cuts for the vehicle routing problem with time windows","volume":"33","author":"Kohl","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib164","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib165","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","article-title":"A GRASP for the vehicle routing problem with time windows","volume":"7","author":"Kontoravdis","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib166","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/0305-0548(93)90064-P","article-title":"Designing collection routes through bank branches","volume":"20","author":"Lambert","year":"1993","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib167","series-title":"Economic Decision Making: Games, Econometrics and Optimisation","first-page":"443","article-title":"Formulations and bounds for the stochastic capacitated vehicle routing problem with uncertain supplies","author":"Laporte","year":"1990"},{"key":"10.1016\/S0927-0507(06)14006-2_bib168","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","article-title":"The integer L-shaped method for stochastic integer programs with complete recourse","volume":"13","author":"Laporte","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0927-0507(06)14006-2_bib169","series-title":"Fleet Management and Logistics","first-page":"159","article-title":"Solving stochastic routing problems with the integer L-shaped method","author":"Laporte","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib170","first-page":"147","article-title":"Exact algorithms for the vehicle routing problem","volume":"31","author":"Laporte","year":"1987","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib171","series-title":"The Vehicle Routing Problem","first-page":"109","article-title":"Classical heuristics for the capacitated VRP","author":"Laporte","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib172","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib173","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/net.3230160104","article-title":"An exact algorithm for the asymmetrical capacitated vehicle routing problem","volume":"16","author":"Laporte","year":"1986","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib174","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0377-2217(89)90354-8","article-title":"Models and exact solutions for a class of stochastic location-routing problems","volume":"39","author":"Laporte","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib175","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","article-title":"The vehicle routing problem with stochastic travel times","volume":"26","author":"Laporte","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib176","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.42.3.543","article-title":"A priori optimization of the probabilistic traveling salesman problem","volume":"42","author":"Laporte","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib177","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","article-title":"An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands","volume":"50","author":"Laporte","year":"2002","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib178","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/trsc.22.3.186","article-title":"Transportation of sludge to the 106-mile site: An inventory routing problem for fleet sizing and logistic system design","volume":"22","author":"Larson","year":"1988","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib179","first-page":"9","article-title":"Integrating local search and network flow to solve the inventory routing problem","volume":"2","author":"Lau","year":"2002","journal-title":"American Association for Artificial Intelligence"},{"key":"10.1016\/S0927-0507(06)14006-2_bib180","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","article-title":"Vehicle routing problem with time windows and a limited number of vehicles","volume":"148","author":"Lau","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib181","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0377-2217(78)90044-9","article-title":"On the solutions of stochastic traveling salesman problems","volume":"2","author":"Leip\u00e4l\u00e4","year":"1978","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib182","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","article-title":"Multistars, partial multistars and the capacitated vehicle routing problem","volume":"94","author":"Letchford","year":"2002","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0927-0507(06)14006-2_bib183","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","article-title":"Very large-scale vehicle routing: New test problems, algorithms and results","volume":"32","author":"Li","year":"2005","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib184","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(02)00486-1","article-title":"Local search with annealing-like restarts to solve the VRPTW","volume":"150","author":"Li","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib185","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the travelling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0927-0507(06)14006-2_bib186","series-title":"Operations Research and Decision Aid Methodologies in Traffic and Transportation Management","first-page":"244","article-title":"An introduction to stochastic transportation models","volume":"vol. 166","author":"Louveaux","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib187","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\/S0927-0507(06)14006-2_bib188","unstructured":"Martinhon, C., Lucena, A., Maculan, N. (2000). A relax and cut algorithm for the vehicle routing problem. Technical Report RT-05\/00, Universidade Federal Fluminense, Niter\u00f3i, Brasil"},{"key":"10.1016\/S0927-0507(06)14006-2_bib189","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","article-title":"Active guided evolution strategies for large scale vehicle routing problem with time windows","volume":"32","author":"Mester","year":"2005","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.7.1.1","article-title":"A matching based exact algorithm for capacitated vehicle routing problems","volume":"7","author":"Miller","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib191","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/ijoc.7.3.298","article-title":"A staged primal-dual algorithm for perfect b-matching with edge capacities","volume":"7","author":"Miller","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib192","unstructured":"Mingozzi, A., Christofides, N., Hadjiconstantinou, E. (1994). An exact algorithm for the vehicle routing problem based on the set partitioning formulation. Technical report, Department of Mathematics, University of Bologna, Italy"},{"key":"10.1016\/S0927-0507(06)14006-2_bib193","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/opre.41.1.77","article-title":"A Markov decision model and decomposition heuristic for dynamic vehicle dispatching","volume":"41","author":"Minkoff","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib194","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib195","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm employing a generalized savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0927-0507(06)14006-2_bib196","series-title":"Handbook of Metaheuristics","first-page":"105","article-title":"A gentle introduction to memetic algorithms","author":"Moscato","year":"2003"},{"key":"10.1016\/S0927-0507(06)14006-2_bib197","series-title":"The Vehicle Routing Problem","first-page":"53","article-title":"Branch-and-cut algorithms for the capacitated VRP","author":"Naddef","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib198","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0305-0548(85)90026-7","article-title":"Implementation techniques for the vehicle routing problem","volume":"12","author":"Nelson","year":"1985","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib199","unstructured":"Or, I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL"},{"key":"10.1016\/S0927-0507(06)14006-2_bib200","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\/S0927-0507(06)14006-2_bib201","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0377-2217(88)90154-3","article-title":"The savings algorithm for the vehicle routing problem","volume":"34","author":"Paessens","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib202","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib203","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","article-title":"The vehicle routing problem with time windows \u2013 Part II: Genetic search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib204","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 Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib205","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","article-title":"An exchange heuristic for routing problems with time windows","volume":"46","author":"Potvin","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib206","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","article-title":"The vehicle routing problem with time windows \u2013 Part I: Tabu search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib207","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib208","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","article-title":"On the capacitated vehicle routing problem","volume":"94","author":"Ralphs","year":"2003","journal-title":"Mathematical Programming B"},{"key":"10.1016\/S0927-0507(06)14006-2_bib209","series-title":"Evolutionsstrategie","author":"Rechenberg","year":"1973"},{"key":"10.1016\/S0927-0507(06)14006-2_bib210","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","article-title":"A subpath ejection method for the vehicle routing problem","volume":"44","author":"Rego","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib211","series-title":"Meta-Heuristics: Theory and Applications","first-page":"661","article-title":"A parallel tabu search algorithm using ejection chains for the vehicle routing problem","author":"Rego","year":"1996"},{"key":"10.1016\/S0927-0507(06)14006-2_bib212","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/trsc.33.4.361","article-title":"Heavy traffic analysis of the dynamic stochastic inventory-routing problem","volume":"33","author":"Reimann","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib213","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","article-title":"D-ants: Savings based ants divide and conquer for the vehicle routing problem","volume":"31","author":"Reimann","year":"2004","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib214","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"8","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0927-0507(06)14006-2_bib215","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1057\/jors.1996.29","article-title":"An improved petal heuristic for the vehicle routing problem","volume":"47","author":"Renaud","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib216","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib217","series-title":"Stochastics in Combinatorial Optimization","first-page":"214","article-title":"Aspects of heuristic methods in the \u201cProbabilistic traveling salesman problem\u201d","author":"Rossi","year":"1987"},{"key":"10.1016\/S0927-0507(06)14006-2_bib218","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.25.3.517","article-title":"An effective heuristic for the M-tour traveling salesman problem with some side conditions","volume":"25","author":"Russell","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib219","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","article-title":"Hybrid heuristics for the vehicle routing problem with time windows","volume":"29","author":"Russell","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib220","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1057\/jors.1993.54","article-title":"Extensions of the petal method for vehicle routing","volume":"44","author":"Ryan","year":"1993","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib221","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib222","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","article-title":"En efficient implementation of local search algorithms for constrained routing problems","volume":"47","author":"Savelsbergh","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib223","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\/S0927-0507(06)14006-2_bib224","unstructured":"Savelsbergh, M.W.P., Song, J.-H. (2005). Inventory routing with continuous moves. Computers & Operations Research, in press"},{"key":"10.1016\/S0927-0507(06)14006-2_bib225","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib226","unstructured":"Secomandi, N. (1998). Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. PhD dissertation, Faculty of the College of Business Administration, University of Houston, TX"},{"key":"10.1016\/S0927-0507(06)14006-2_bib227","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/S0305-0548(99)00146-X","article-title":"Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands","volume":"27","author":"Secomandi","year":"2000","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib228","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1025605803490","article-title":"Analysis of a rollout approach to sequencing problems with stochastic routing applications","volume":"9","author":"Secomandi","year":"2003","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib229","unstructured":"S\u00e9guin, R. (1994). Probl\u00e8mes stochastiques de tourn\u00e9es de v\u00e9hicules. PhD thesis, D\u00e9partement d'informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada"},{"key":"10.1016\/S0927-0507(06)14006-2_bib230","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF02023006","article-title":"Solving real-life vehicle routing problems efficiently using tabu search","volume":"41","author":"Semet","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib231","series-title":"Principles and Practice of Constraint Programming","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib232","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1287\/opre.29.6.1234","article-title":"Analysis of a preference order traveling salesman problem","volume":"29","author":"Sniedovich","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib233","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib234","series-title":"Vehicle Routing: Methods and Studies","first-page":"85","article-title":"Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures","author":"Solomon","year":"1988"},{"key":"10.1016\/S0927-0507(06)14006-2_bib235","unstructured":"Song, J.-H., Savelsbergh, M.W.P. (2005). Performance measurement for inventory routing. Transportation Science, in press"},{"key":"10.1016\/S0927-0507(06)14006-2_bib236","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0377-2217(83)90237-0","article-title":"Stochastic vehicle routing: A comprehensive approach","volume":"14","author":"Stewart","year":"1983","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib237","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(06)14006-2_bib238","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib239","first-page":"170","article-title":"Hybrid genetic algorithms in solving vehicle routing problems with time window constraints","volume":"18","author":"Tan","year":"2001","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib240","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021157406318","article-title":"Bone route: Adaptive memory method for effective fleet management","volume":"115","author":"Tarantilis","year":"2002","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib241","series-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","first-page":"253","article-title":"Introduction to genetic heuristics and vehicle routing problems with complex constraints","volume":"vol. 9","author":"Thangiah","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib242","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","article-title":"Cyclic transfer algorithms for multi-vehicle routing and scheduling problems","volume":"41","author":"Thompson","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib243","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with probabilistic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib244","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02098285","article-title":"An exact algorithm for the capacitated shortest spanning arborescence","volume":"61","author":"Toth","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib245","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1287\/trsc.31.4.372","article-title":"An exact algorithm for the vehicle routing problem with backhauls","volume":"31","author":"Toth","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib246","series-title":"Fleet Management and Logistics","first-page":"1","article-title":"Exact algorithms for vehicle routing","author":"Toth","year":"1998"},{"key":"10.1016\/S0927-0507(06)14006-2_bib247","series-title":"The Vehicle Routing Problem","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib248","series-title":"The Vehicle Routing Problem","first-page":"1","article-title":"An overview of vehicle routing problems","author":"Toth","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib249","series-title":"The Vehicle Routing Problem","first-page":"29","article-title":"Branch-and-bound algorithms for the capacitated VRP","author":"Toth","year":"2002"},{"key":"10.1016\/S0927-0507(06)14006-2_bib250","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","article-title":"Models, relaxations and exact approaches for the capacitated vehicle routing problem","volume":"123","author":"Toth","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib251","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"},{"key":"10.1016\/S0927-0507(06)14006-2_bib252","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.26.3.171","article-title":"Stochastic inventory routing: Route design with stockouts and route failures","volume":"26","author":"Trudeau","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib253","unstructured":"Van Breedam, A. (1994). An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. PhD dissertation, University of Antwerp, Belgium"},{"key":"10.1016\/S0927-0507(06)14006-2_bib254","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","article-title":"L-shaped programs with applications to optimal control and stochastic programming","volume":"17","author":"Van Slyke","year":"1969","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib255","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1021814225969","article-title":"The sample average approximation method applied to stochastic routing problems: A computational study","volume":"24","author":"Verweij","year":"2003","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0927-0507(06)14006-2_bib256","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0377-2217(96)00223-8","article-title":"A heuristic algorithm for the asymmetric capacitated vehicle routing problem","volume":"89","author":"Vigo","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib257","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/mnsc.43.3.294","article-title":"Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems","volume":"43","author":"Viswanathan","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib258","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(83)90161-3","article-title":"The symmetric traveling salesman problem and edge exchange in minimal 1-trees","volume":"12","author":"Volgenant","year":"1983","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib259","unstructured":"Voudouris, C. (1997). Guided local search for combinatorial problems. Dissertation, University of Essex, United Kingdom"},{"key":"10.1016\/S0927-0507(06)14006-2_bib260","first-page":"183","article-title":"Vendor-managed inventory in the retail supply chain","volume":"20","author":"Waller","year":"1999","journal-title":"Journal of Business Logistics"},{"key":"10.1016\/S0927-0507(06)14006-2_bib261","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3141\/1771-08","article-title":"Assignment models for local truckload trucking problems with stochastic service times and time window constraints","volume":"1171","author":"Wang","year":"2001","journal-title":"Transportation Research Record"},{"key":"10.1016\/S0927-0507(06)14006-2_bib262","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1057\/jors.1994.185","article-title":"A repeated matching heuristic for the vehicle routing problem","volume":"45","author":"Wark","year":"1994","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib263","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1057\/jors.1989.191","article-title":"Vehicle-scheduling problems with uncertainty and omitted customers","volume":"40","author":"Waters","year":"1989","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(06)14006-2_bib264","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0377-2217(93)E0232-M","article-title":"Period and phase of customer replenishment: A new approach to the strategic inventory\/routing problem","volume":"85","author":"Webb","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(06)14006-2_bib265","unstructured":"Willard, J.A.G. (1989). Vehicle routing using r-optimal tabu search. MSc dissertation, The Management School, Imperial College, London"},{"key":"10.1016\/S0927-0507(06)14006-2_bib266","series-title":"Computers in Transport Planning and Operation","author":"Wren","year":"1971"},{"key":"10.1016\/S0927-0507(06)14006-2_bib267","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1057\/jors.1972.53","article-title":"Computer scheduling of vehicles from one or more depots to a number of delivery points","volume":"23","author":"Wren","year":"1972","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0927-0507(06)14006-2_bib268","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","article-title":"A network flow-based tabu search heuristic for the vehicle routing problem","volume":"30","author":"Xu","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(06)14006-2_bib269","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","article-title":"Stochastic vehicle routing with restocking","volume":"34","author":"Yang","year":"2000","journal-title":"Transportation Science"}],"container-title":["Handbooks in Operations Research and Management Science","Transportation"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T03:35:51Z","timestamp":1587267351000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0927050706140062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9780444513465"],"references-count":269,"URL":"https:\/\/doi.org\/10.1016\/s0927-0507(06)14006-2","relation":{},"ISSN":["0927-0507"],"issn-type":[{"value":"0927-0507","type":"print"}],"subject":[],"published":{"date-parts":[[2007]]}}}