The pickup and delivery problem with time windows

European Journal of Operational Research

Volumn 54, Issue 1, 1991, Pages 7-22

  Dumas, Yvan ^a   Desrosiers, Jacques ^a   Soumis, François ^a  

^a GERAD   (Canada)

Author keywords

column generation; routing; scheduling; Transportation

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; OPERATIONS RESEARCH;

COLUMN GENERATION; TIME WINDOWS; VEHICLE ROUTING PROBLEM (VRP);

SCHEDULING;

EID: 0026417178     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(91)90319-Q     Document Type: Article

References (29)

1. The routing and scheduling of vehicles and crews — The state of the art
2. The multi-vehicle subscriber dial-a-ride problem
3. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
4. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
5. Vehicle routing with time windows: Optimization and approximation
6. A reoptimization algorithm for the shortest path problem with time windows
7. A generalized permanent labeling algorithm for the shortest path problem with time windows
8. A Column Generation Approach to the Urban Transit Crew Scheduling Problem
9. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows
10. The multiple vehicle dial-a-ride problem
11. Plus court chemin avec contraintes d'horaires
12. Routing with time windows by column generation
13. Le système T.I.R.: un système d'établissement de tournées industrielles routières
14. A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with windows
15. Vehicle routing with time windows
16. Exact algorithms for the vehicle routing problems
17. A new approach for crew pairing problems by column generation with application to air transportation
18. Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
19. Integer Programming Formulation of Traveling Salesman Problems
20. A dynamic programming solution to the single-vehicle, many-to-many, immediate request dial-a-ride problem
21. An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows
22. Routing and scheduling for the transportation of disabled persons — The algorithm
23. Routing and scheduling for the transportation of disabled persons — The tests
24. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling
25. Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing
26. Pick-up and delivery of partial loads with time windows
27. Time window constrained routing and scheduling problems