Vehicle Routing and Scheduling with Full Truckloads
Authors:
- 1 May 2003
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 37 (2) , 170-182
Abstract
Truckload carriers are constantly faced with the problem of shipping full truckloads of goods at minimum cost between pairs of cities or customers, using a fleet of trucks located at one or more depots. In this paper, a new branch-and-bound algorithm for solving an integer-programming formulation of this vehicle-routing problem (VRP) with full truckloads is developed. The algorithm also takes into consideration the time-window constraints and waiting costs. The resulting efficiency, validated by computational tests on random problems, is due to a column-generation scheme that exploits the special structure of the problem to solve the linear-programming relaxation problems that arise at the nodes.Keywords
This publication has 16 references indexed in Scilit:
- Multi-depot vehicle scheduling problems with time windows and waiting costsEuropean Journal of Operational Research, 1998
- An Exact Algorithm for Combining Vehicle Trips1995
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling ProblemManagement Science, 1993
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- A set‐partitioning‐based exact algorithm for the vehicle routing problemNetworks, 1989
- Vehicle routing with full loadsComputers & Operations Research, 1988
- On some matching problems arising in vehicle scheduling modelsNetworks, 1987
- Routing with time windows by column generationNetworks, 1984
- PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTIONDecision Sciences, 1983
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980