A tabu search heuristic for the single vehicle pickup and delivery problem with time windows

Journal of Intelligent Manufacturing

Volumn 12, Issue 5-6, 2001, Pages 497-508

  Landrieu, Antoine ^a   Mati, Yazid ^a   Binder, Zdenek ^a  

^a ENSIEG   (France)

Author keywords

Metaheuristics; Pickup and delivery; Tabu search; Time windows; Vehicle routing

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING;

PROBABILISTIC TABU SEARCH (PTS); VEHICLE PICKUPS;

TRAVELING SALESMAN PROBLEM;

EID: 0035482443     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012204504849     Document Type: Article

References (34)

1. Routing and scheduling of vehicles and crew: The state of the art
2. The multi-vehicle subscriber dial-a-ride problem
3. Variable-depth search for the single-vehicle pickup and delivery problem with time windows
4. Vehicle routing with time windows: Optimisation and approximation
5. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows
6. The pickup and delivery problem with time windows
7. Vehicle routing: Modern heuristics
8. Tabu search. I
9. Tabu search. II
10. The impact of metaheuristics on solving the vehicle routing problems: Algorithms, problem sets, and computational results
11. A new extension of local search applied to the dial a ride problem
12. A request clustering algorithm for door-to-door handicapped transportation
13. An algorithm for the traveling salesman with pickup and delivery customers
14. Integrating target analysis and tabu search for improved scheduling problems
15. An effective heuristic algorithm for the traveling salesman problem
16. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
17. The pickup and delivery problem with time windows
18. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem
19. An exact algorithm for the single vehicle many-to-many immediate request dial-a-ride problem with time windows
20. 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem
21. The general pickup and delivery problem
22. Drive: Dynamic routing of independant vehicles
23. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling
24. Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing
25. Pick-up and delivery of partial loads with time windows
26. Modelling a railway freight transport system
27. Tabu search applied to the quadratic assignment problem
28. Robust Taboo search for the quadratic assignment problem
29. A tabu search heuristic for the vehicle routing problem with soft time windows