VEHICLE-ROUTING WITH TIME WINDOWS - 2 OPTIMIZATION ALGORITHMS

Authors
FISHER ML JORNSTEN KO MADSEN OBG
Citation
Ml. Fisher et al., VEHICLE-ROUTING WITH TIME WINDOWS - 2 OPTIMIZATION ALGORITHMS, Operations research, 45(3), 1997, pp. 488-492
Citations number
16
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research → ACNP
ISSN journal
0030364X
Volume
45
Issue
3
Year of publication
1997
Pages
488 - 492
Database
ISI
SICI code
0030-364X(1997)45:3<488:VWTW-2>2.0.ZU;2-1
Abstract
We describe two optimization methods for vehicle routing problems with time windows. These are a K-Tree relaxation with time windows added a s side constraints and a Lagrangian decomposition in which variable sp litting is used to divide the problem into two subproblems-a semi-assi gnment problem and a series of shortest path problems with time window s and capacity constraints. We present optimal solutions to problems w ith up to 100 customers.