A set covering approach for multi-depot train driver scheduling
暂无分享,去创建一个
[1] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[2] Matteo Fischetti,et al. Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..
[3] M. B. Wright. Computer-aided Transit Scheduling , 1990 .
[4] Masoud Yaghini,et al. RAILWAY CREW SCHEDULING USING HEURISTIC MODEL , 2010 .
[5] Jacques Desrosiers,et al. Crew Pairing at Air France , 1993 .
[6] Anthony Wren,et al. Bus Driver Scheduling — An Overview , 1995 .
[7] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[8] Francis J. Vasko,et al. Using a facility location algorithm to solve large set covering problems , 1984 .
[9] Christian Blum,et al. Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..
[10] Ann S. K. Kwan,et al. Effective search space control for large and/or complex driver scheduling problems , 2007, Ann. Oper. Res..
[11] Ellis L. Johnson,et al. Solving Large Scale Crew Scheduling Problems , 1997 .
[12] Shangyao Yan,et al. Airline cockpit crew scheduling , 2002, Eur. J. Oper. Res..
[13] M. Padberg,et al. Solving airline crew scheduling problems by branch-and-cut , 1993 .
[14] David Levine,et al. Application of a hybrid genetic algorithm to airline crew scheduling , 1996, Comput. Oper. Res..
[15] Stefan Voß,et al. Metaheuristics: Intelligent Problem Solving , 2010, Matheuristics.
[16] D. I. Calvert,et al. Computer Scheduling of Public Transport 2 , 1986 .
[17] Matteo Fischetti,et al. A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..
[18] Egon Balas,et al. A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..
[19] S. Chatterjee,et al. Genetic algorithms and traveling salesman problems , 1996 .
[20] Dennis Huisman. A column generation approach for the rail crew re-scheduling problem , 2007, Eur. J. Oper. Res..
[21] Francis J. Vasko,et al. An efficient heuristic for large set covering problems , 1984 .
[22] Vittorio Maniezzo,et al. Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .
[23] Martin Desrochers,et al. Computer-Aided Transit Scheduling , 1992 .
[24] Marta Mesquita,et al. Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem , 2008, Comput. Oper. Res..
[25] Guanghui Lan,et al. An effective and simple heuristic for the set covering problem , 2007, Eur. J. Oper. Res..
[26] K. Al-Sultan,et al. A Genetic Algorithm for the Set Covering Problem , 1996 .
[27] S. Balachandar,et al. A Meta-Heuristic Algorithm for Vertex Covering Problem Based on Gravity , 2010 .
[28] A Wren,et al. A GENERAL REVIEW OF THE USE OF COMPUTERS IN SCHEDULING BUSES AND THEIR CREWS , 1980 .
[29] M. Yagiura,et al. RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM , 2007 .
[30] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[31] Charu C. Aggarwal,et al. On multiroute maximum flows in networks , 2002, Networks.
[32] Andrew C. Ho,et al. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .
[33] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[34] Dennis Huisman. A column generation approach to solve the crew re-scheduling problem , 2005 .
[35] Matteo Fischetti,et al. Modeling and Solving the Crew Rostering Problem , 1998, Oper. Res..
[36] Cynthia Barnhart,et al. An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem , 1998, Transp. Sci..
[37] Davis Avis. A note on some computationally difficult set covering problems , 1980, Math. Program..
[38] Jian Liu,et al. Solving Real-Life Locomotive-Scheduling Problems , 2005, Transp. Sci..
[39] Matteo Fischetti,et al. Algorithms for railway crew management , 1997, Math. Program..
[40] A Wren. GENERAL REVIEW OF THE USE OF COMPUTERS IN SCHEDULING BUSES AND THEIR CREWS. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .
[41] Stefan Voß,et al. Computer-Aided Scheduling of Public Transport , 2001 .
[42] M. Fisher,et al. Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .
[43] Andreas T. Ernst,et al. An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..
[44] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[45] Claude Le Pape,et al. Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..
[46] Toshihide Ibaraki,et al. A 3-flip neighborhood local search for the set covering problem , 2006, Eur. J. Oper. Res..
[47] F. Glover,et al. Fundamentals of Scatter Search and Path Relinking , 2000 .
[48] Alexander H. G. Rinnooy Kan,et al. The Design, Analysis and Implementation of Heuristics , 1988 .
[49] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .
[50] Andreas T. Ernst,et al. Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..
[51] Zhi-Gang Ren,et al. New ideas for applying ant colony optimization to the set covering problem , 2010, Comput. Ind. Eng..
[52] Paolo Toth,et al. Chapter 3 Passenger Railway Optimization , 2007, Transportation.
[53] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[54] José Humberto Ablanedo-Rosas,et al. Surrogate constraint normalization for the set covering problem , 2010, Eur. J. Oper. Res..
[55] Woo-Tsong Lin,et al. Ant colony optimization-based algorithm for airline crew scheduling problem , 2011, Expert Syst. Appl..
[56] Thomas Stützle,et al. A Comparison Between ACO Algorithms for the Set Covering Problem , 2004, ANTS Workshop.
[57] Antonio Bolufé Röhler,et al. Matheuristics: Optimization, Simulation and Control , 2009, Hybrid Metaheuristics.
[58] M. V. Riel,et al. Crew Scheduling for Netherlands Railways “ Destination : Customer ” , 2000 .
[59] Erik Andersson,et al. Crew Pairing Optimization , 1998 .
[60] Marco Caserta,et al. Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems , 2007, Metaheuristics.
[61] Ravindra K. Ahuja,et al. Network Flows , 2011 .
[62] Leo G. Kroon,et al. Reinventing Crew Scheduling at Netherlands Railways , 2004, Interfaces.
[63] Chi-Kang Lee,et al. SCHEDULING OF TRAIN DRIVER FOR TAIWAN RAILWAY ADMINISTRATION , 2003 .
[64] Pasquale Avella,et al. Computational experience with general cutting planes for the Set Covering problem , 2009, Oper. Res. Lett..
[65] Michael J. Brusco,et al. A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems , 1999, Ann. Oper. Res..
[66] Edward K. Baker,et al. Efficient heuristic algorithms for the weighted set covering problem , 1981, Comput. Oper. Res..
[67] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..