Subgraph ejection chains and tabu search for the crew scheduling problem

Journal of the Operational Research Society

Volumn 50, Issue 6, 1999, Pages 608-616

  Cavique, L ^a   Rego, C ^b   Themido, I ^c  

^a INSTITUTO POLITÉCNICO DE SETÚBAL   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

^c INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Crew scheduling; Ejection chains; Heuristics; Run cutting; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DECISION SUPPORT SYSTEMS; HEURISTIC METHODS; PERSONNEL; PROBLEM SOLVING; STATISTICAL METHODS; WORK-REST SCHEDULES;

SUBGRAPH EJECTION CHAINS; TABU SEARCH METHODS;

SCHEDULING;

EID: 0032628592     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600728     Document Type: Article

References (23)

1. Bodin L and Berman D (eds) (1975). Workshop on Automated Techniques for Scheduling of Vehicles Operator for Urban Transportation Services, Pre-print.
2. Wren A (ed) (1981). Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. North-Holland, Amsterdam.
3. Rousseau JM (ed) (1985). Computer Scheduling of Public Transport 2. North-Holland, Amsterdam.
4. Daduna J and Wren A (eds) (1988). Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Heidelberg.
5. Desrochers M and Rousseau JM (eds) (1992). Proceedings of the Fifth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Heidelberg.
6. Daduna J, Branco I and Paixao J (eds) (1995). Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Heidelberg.
7. Wilson N (ed) (1997). Proceedings of the Seventh International Workshop on Computer-Aided Scheduling of Public Transport, 1997. To appear in Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Heidelberg.
8. Bodin L, Golden B, Assad A and Ball M (1983). Routing and scheduling of vehicles and crews—The state of the art. Comp and Opns Res 10: 63-212.
9. Wren A and Rousseau J (1995). Bus driver scheduling: an overview. In: Daduna J, Branco I and Paixao J (eds). Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Heidelberg, pp 173-187.
10. Hartley T (1981). A glossary of terms in bus and crew scheduling. In: Wren A (ed). Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam, pp 353-359.
11. Falkner J and Ryan D (1992). Express: Set partitioning for bus crew scheduling in Christchurch. In: Desrochers M and Rousseau JM (eds) (1992). Proceedings of the Fifth International Workshop on Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Heidelberg, pp 359-378.
12. Rich E and Knight K (1991). Artificial Intelligence. McGraw- Hill, USA.
13. Reingold E, Nievergelt J and Deo J (1977). Combinatorial Algorithms. Prentice-Hall, New Jersey.
14. Glover F (1989). Tabu search—Part I. ORSA J Comp 1: 190-206.
15. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers, Boston, MA.
16. Cavique L (1994). Sequenciamento de pessoal tripulante. M.S. Thesis, Universidade Tecnica de Lisboa—Instituto Superior Tecnico, Portugal.
17. Cavique L and Themido I (1995). Sequenciamento de servigos de pessoal tripulante: uma abordagem baseada num conjunto de heurísticas. Invest Opl 15: 123-141.
18. Glover F (1992). Ejection Chains, reference structures and alternating path methods for the travelling salesman problem. Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder, USA.
19. Rego C (1996). Local Search and Neighborhood Structures for Vehicle Routing Problems: Sequential and Parallel Algorithms. PhD Thesis, PRiSM Laboratory, University of Versailles, France.
20. Hertz A and de Werra D (1987). Using tabu search techniques for graph coloring. Computing 39: 345-351.
21. Rego C and Roucairol C (1996). Parallel tabu search algorithm based on ejection chains for the vehicle routing problem. In: Osman IH, Kelly JP (eds). Metaheuristics: Theory and Applications. Kluwer Academic Publishers, Boston, MA.
22. Rego C (1998). Relaxed tours and path ejection for the traveling salesman problem. Eur J Opl Res 106: 522-538.
23. Rego C (1998). A subpath ejection method for the vehicle routing problem. Mmt Sci 44: 1447-1459.