Mathematical optimization of rolling stock rotations
暂无分享,去创建一个
[1] Ralf Borndörfer,et al. Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning , 2011, OR.
[2] R. Gomory,et al. A Primal Method for the Assignment and Transportation Problems , 1964 .
[3] Paolo Toth,et al. Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..
[4] Thibaut Vidal. Approches générales de résolution pour les problèmes multi-attributs de tournées de véhicules et confection d'horaires , 2013 .
[5] Marc E. Pfetsch,et al. Line Planning and Connectivity , 2009, Models and Algorithms for Optimization in Logistics.
[6] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[7] Edward Rothberg,et al. An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions , 2007, INFORMS J. Comput..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Claude Le Pape,et al. Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..
[10] Thomas Schlechte,et al. Analysis of Micro-Macro Transformations of Railway Networks , 2013, OR.
[11] Steffen Weider,et al. Integration of Vehicle and Duty Scheduling in Public Transport , 2007 .
[12] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[13] Leo Kroon,et al. Maintenance Appointments in Railway Rolling Stock Rescheduling , 2016 .
[14] Lucas P. Veelenturf,et al. A Comparison of Two Exact Methods for Passenger Railway Rolling Stock (Re)Scheduling , 2015 .
[15] Gerard Sierksma,et al. Tolerance-based Branch and Bound algorithms for the ATSP , 2008, Eur. J. Oper. Res..
[16] R. Borndörfer,et al. Aspects of Set Packing, Partitioning, and Covering , 1998 .
[17] Andreas Bärmann,et al. Solving network design problems via iterative aggregation , 2015, Math. Program. Comput..
[18] Sepideh Ahmadi,et al. Rolling Stock Rotation Optimization in Days of Strike: An Automated Approach for Creating an Alternative Timetable , 2015 .
[19] Paolo Toth,et al. Vehicle Routing , 2014, Vehicle Routing.
[20] Ralf Borndörfer,et al. The hypergraph assignment problem , 2015, Discret. Optim..
[21] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[22] A. Löbel. Optimale Vehicle Scheduling in Public Transit , 1997 .
[23] Jacques Desrosiers,et al. Selected Topics in Column Generation , 2002, Oper. Res..
[24] Ralf Borndörfer,et al. Micro-macro transformation of railway networks , 2011, J. Rail Transp. Plan. Manag..
[25] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[26] G. Maróti,et al. Maintenance Routing for Train Units: The Transition Model , 2005, Transp. Sci..
[27] Maria Grazia Scutellà,et al. Flows on hypergraphs , 1997, Math. Program..
[28] Bjarne Stroustrup,et al. The C++ Programming Language, 4th Edition , 2013 .
[29] M. Fischetti,et al. A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs , 1994, Oper. Res..
[30] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .
[31] Tore Grünert,et al. Sequential search and its application to vehicle-routing problems , 2006, Comput. Oper. Res..
[32] Matthias Ehrgott,et al. Multicriteria Optimization (2. ed.) , 2005 .
[33] Martin W. P. Savelsbergh,et al. Conflict Graphs in Integer Programming , 1998 .
[34] Karl Nachtigall,et al. Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations , 2008, ATMOS.
[35] M. Balinski,et al. On the Assignment Polytope , 1974 .
[36] Y. Shiloach. The two paths problem is polynomial , 1978 .
[37] Keld Helsgaun,et al. General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..
[38] Thomas Schlechte,et al. Railway Track Allocation: Models and Algorithms , 2012 .
[39] Guy Desaulniers,et al. Dynamic Aggregation of Set-Partitioning Constraints in Column Generation , 2003, Oper. Res..
[40] Dario Pacciarelli,et al. Short-term Rail Rolling Stock Rostering and Maintenance Scheduling , 2014 .
[41] Jian Liu,et al. Solving Real-Life Locomotive-Scheduling Problems , 2005, Transp. Sci..
[42] Ralf Borndörfer,et al. Duty scheduling templates , 2013, Public Transp..
[43] David Pisinger,et al. Reactive Robustness and Integrated Approaches for Railway Optimization Problems , 2015 .
[44] Jean-François Cordeau,et al. Simultaneous Assignment of Locomotives and Cars to Passenger Trains , 1998, Oper. Res..
[45] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[46] Lars Kjaer Nielsen,et al. Rolling Stock Rescheduling in Passenger Railways: Applications in short-term planning and in disruption management , 2011 .
[47] Rolf H. Möhring,et al. Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems , 2009, Robust and Online Large-Scale Optimization.
[48] Dario Pacciarelli,et al. Rolling Stock Rostering Optimization Under Maintenance Constraints , 2014, J. Intell. Transp. Syst..
[49] Leena Suhl,et al. Rotation Planning of Locomotive and Carriage Groups with Shared Capacities , 2004, ATMOS.
[50] Dennis Huisman. A column generation approach for the rail crew re-scheduling problem , 2007, Eur. J. Oper. Res..
[51] James R. Evans,et al. Aggregation and Disaggregation Techniques and Methodology in Optimization , 1991, Oper. Res..
[52] Stephan Eidenbenz,et al. Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations , 2003, ALENEX.
[53] Matteo Fischetti,et al. {0, 1/2}-Chvátal-Gomory cuts , 1996, Math. Program..
[54] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[55] Nicola Secomandi,et al. Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands , 2009, Oper. Res..
[56] Leo G. Kroon,et al. Maintenance routing for train units: The interchange model , 2007, Comput. Oper. Res..
[57] Jesper Larsen,et al. An integrated rolling stock planning model for the Copenhagen suburban passenger railway , 2015, J. Rail Transp. Plan. Manag..
[58] Irina Dumitrescu,et al. Constrained path and cycle problems , 2002 .
[59] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[60] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[61] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[62] Rolf H. Möhring,et al. The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond , 2004, ATMOS.
[63] Sylvie Gélinas,et al. Locomotive assignment with heterogeneous consists at CN North America , 1997 .
[64] Thomas Schlechte,et al. A direct comparison of physical block occupancy versus timed block occupancy in train timetabling formulations , 2013 .
[65] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..
[66] Cornelis Vuik,et al. A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation , 2010, SIAM J. Matrix Anal. Appl..
[67] Marcus Poggi de Aragão,et al. Improved branch-cut-and-price for capacitated vehicle routing , 2016, Mathematical Programming Computation.
[68] Timo Berthold. Heuristic algorithms in global MINLP solvers , 2014 .
[69] Ralf Borndörfer,et al. A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit , 2008 .
[70] Leo G. Kroon,et al. A rolling stock circulation model for combining and splitting of passenger trains , 2006, Eur. J. Oper. Res..
[71] Bruce L. Golden,et al. A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..
[72] Dennis Huisman,et al. Rescheduling in passenger railways: the rolling stock rebalancing problem , 2010, J. Sched..
[73] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[74] Luigi Di Puglia Pugliese,et al. A survey of resource constrained shortest path problems: Exact solution approaches , 2013, Networks.
[75] François Soumis,et al. Integral Simplex Using Decomposition for the Set Partitioning Problem , 2014, Oper. Res..
[76] David Pisinger,et al. A Branch-and-Price Framework for Railway Rolling Stock Rescheduling During Disruptions , 2014 .
[77] Paolo Toth,et al. A Fast Heuristic Algorithm for the Train Unit Assignment Problem , 2012, ATMOS.
[78] Giorgio Gallo,et al. Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..
[79] Christopher Raphael,et al. Coarse-to-Fine Dynamic Programming , 2001, IEEE Trans. Pattern Anal. Mach. Intell..