Waiting strategies for the dynamic pickup and delivery problem with time windows
Authors:
- Snežana Mitrović-MinićSMSnežana Mitrović-Minić
- Gilbert LaporteGLGilbert Laporte
- 1 August 2004
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 38 (7) , 635-655
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Double-horizon based heuristics for the dynamic pickup and delivery problem with time windowsTransportation Research Part B: Methodological, 2004
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- Solving the pickup and delivery problem with time windows using reactive tabu searchTransportation Research Part B: Methodological, 2000
- Decision support for vehicle dispatching using genetic programmingIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998
- A computer assistant for vehicle dispatching with learning capabilitiesAnnals of Operations Research, 1995
- Dynamic vehicle routing: Status and prospectsAnnals of Operations Research, 1995
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectivesAnnals of Operations Research, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Optimization models and algorithms: an emerging technology for the motor carrier industryIEEE Transactions on Vehicular Technology, 1991
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986