Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows
- 30 September 2004
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 38 (8), 669-685
- https://doi.org/10.1016/j.trb.2003.09.001
Abstract
No abstract availableFunding Information
- Natural Sciences and Engineering Research Council of Canada (OGP0039682, RGPIN36809)
This publication has 23 references indexed in Scilit:
- 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
- Evaluation of Dynamic Fleet Management Systems: Simulation FrameworkTransportation Research Record: Journal of the Transportation Research Board, 1998
- A computer assistant for vehicle dispatching with learning capabilitiesAnnals of Operations Research, 1995
- Dynamic vehicle routing: Status and prospectsAnnals of Operations Research, 1995
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- Local search in routing problems with time windowsAnnals of Operations Research, 1985
- An approximate analytic model of many-to-many demand responsive transportation systemsTransportation Research, 1978