Drive: Dynamic Routing of Independent Vehicles
- 1 August 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 46 (4) , 474-490
Abstract
We present DRIVE (Dynamic Routing of Independent VEhicles), a planning module to be incorporated in a decision support system for the direct transportation at Van Gend and Loos BV. Van Gend and Loos BV is the largest company providing road transportation in the Benelux, with about 1400 vehicles transporting 160,000 packages from thousands of senders to tens of thousands of addressees per day. The heart of DRIVE is a branch-and-price algorithm. Approximation and incomplete optimization techniques as well as a sophisticated column management scheme have been employed to create the right balance between solution speed and solution quality. DRIVE has been tested by simulating a dynamic planning environment with real-life data and has produced very encouraging results.Keywords
This publication has 8 references indexed in Scilit:
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998
- The General Pickup and Delivery ProblemTransportation Science, 1995
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- MINTO, a mixed INTeger optimizerOperations Research Letters, 1994
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- A global approach to crew-pairing optimizationIBM Systems Journal, 1992
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980