Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
Authors:
- 1 April 2003
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 54 (4) , 390-400
Abstract
The problem considered is the full-load pickup and delivery problem with time windows (PDPTW), and heterogeneous products and vehicles, where the assignment of pickup points to requests is not predetermined. The problem is first formulated as a 0-1 LP, then a hybrid algorithm is developed, which chooses dynamically between a Greedy heuristic and one based on Regret costs. A multi-level constructive heuristic that consists of three post-optimizers is presented. Two lower bounds are used to evaluate the performance of the proposed heuristics when tested on random instances and selected data from a construction company.Keywords
This publication has 10 references indexed in Scilit:
- Diversion Issues in Real-Time Vehicle DispatchingTransportation Science, 2000
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problemEuropean Journal of Operational Research, 1997
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time WindowsTransportation Science, 1997
- Optimal sequencing of skip collections and deliveriesJournal of the Operational Research Society, 1997
- The Vehicle Routing Problem with Time Windows Part I: Tabu SearchINFORMS Journal on Computing, 1996
- Hybrid Heuristics for the Vehicle Routing Problem with Time WindowsTransportation Science, 1995
- The General Pickup and Delivery ProblemTransportation Science, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Survey Paper—Time Window Constrained Routing and Scheduling ProblemsTransportation Science, 1988
- A Transportation Location-Allocation Model for Regional Blood BankingA I I E Transactions, 1979