A polyhedral approach to simplified crew scheduling and vehicle scheduling problems

Management Science

Volumn 47, Issue 6, 2001, Pages 833-850

  Fischetti, Matteo ^a   Lodi, Andrea ^a   Martello, Silvano ^a   Toth, Paolo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Crew Scheduling; Polyhedral Methods; Vehicle Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; CREW ACCOMMODATIONS; HEURISTIC METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

PUBLIC TRANSIT MANAGEMENT; VEHICLE SCHEDULING;

SCHEDULING;

EID: 0035381975     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.47.6.833.9810     Document Type: Article

References (29)

1. Generating pseudo-random permutations and maximum flow algorithms
2. A polyhedral study of the asymmetric travelling salesman problem with time windows
3. Branch-and-price: Column generation for solving huge integer programs
4. A tree search algorithm for the crew scheduling problem
5. A dynamic programming based algorithm for the crew scheduling problem
6. A set partitioning approach to the multiple depot vehicle scheduling problem
7. Branch-and-cut algorithms
8. Algorithms and codes for the assignment problem
9. A branch and bound algorithm for the multiple depot vehicle scheduling problem
10. Analysis of preflow push algorithms for maximum network flow
11. Heuristic algorithms for the multiple depot vehicle scheduling problem
12. Time constrained routing and scheduling
13. Stabilisation dans le cadre de la génération de colonnes
14. A polyhedral approach to the asymmetric traveling salesman problem
15. The fixed job schedule problem with spread-time constraints
16. The fixed job schedule problem with working-time constraints
17. An LP-based heuristic approach to the crew scheduling problem
18. An exact algorithm for the multiple depot bus scheduling problem
19. A new approach to the maximum flow problem
20. Vehicle scheduling in public transit Lagrangean pricing
21. A set partitioning approach to the crew scheduling problem
22. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
23. A column generation approach to the multiple depot vehicle scheduling problem
24. Decomposition and column generation