Reactive Robustness and Integrated Approaches for Railway Optimization Problems
暂无分享,去创建一个
[1] Ralf Borndörfer,et al. Konrad-zuse-zentrum Für Informationstechnik Berlin a Hypergraph Model for Railway Vehicle Rotation Planning a Hypergraph Model for Railway Vehicle Rotation Planning * , 2022 .
[2] Daniel Potthoff,et al. Disruption Management in Passenger Railway Transportation , 2007, Robust and Online Large-Scale Optimization.
[3] Jean-François Cordeau,et al. Simultaneous Assignment of Locomotives and Cars to Passenger Trains , 1998, Oper. Res..
[4] Riko Jacob,et al. Multistage methods for freight train classification , 2007, Networks.
[5] M. Meyer,et al. An algorithm for the optimal control of the driving of trains , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).
[6] Luis Cadarso,et al. Improving robustness of rolling stock circulations in rapid transit networks , 2014, Comput. Oper. Res..
[7] François Ramond,et al. Trains don't vanish ! ROADEF EURO 2014 Challenge Problem Description , 2014 .
[8] Lawrence Bodin,et al. A model for the blocking of trains , 1980 .
[9] Cynthia Barnhart,et al. Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..
[10] Guy Desaulniers,et al. Dispatching Buses in a Depot Using Block Patterns , 2006, Transp. Sci..
[11] Armin Fügenschuh,et al. Scheduling Locomotives and Car Transfers in Freight Transport , 2008, Transp. Sci..
[12] Phil Howlett,et al. The Optimal Control of a Train , 2000, Ann. Oper. Res..
[13] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[14] Paolo Toth,et al. Nominal and robust train timetabling problems , 2012, Eur. J. Oper. Res..
[15] Brunilde Sansò,et al. Instantaneous Power Peak Reduction and Train Scheduling Desynchronization in Subway Systems , 1997, Transp. Sci..
[16] E R Kraft. PRIORITY-BASED CLASSIFICATION FOR IMPROVING CONNECTION RELIABILITY IN RAILROAD YARDS. PART II OF II: DYNAMIC BLOCK TO TRACK ASSIGNMENT , 2002 .
[17] Florian Jaehn,et al. A note on "Multistage Methods for Freight Train Classification" , 2013, Networks.
[18] Stefan Irnich. Resource extension functions: properties, inversion, and generalization to segments , 2008, OR Spectr..
[19] Jacques Desrosiers,et al. Chapter 2 Time constrained routing and scheduling , 1995 .
[20] Nils Boysen,et al. Shunting yard operations: Theoretical aspects and applications , 2012, Eur. J. Oper. Res..
[21] Jens H. Maue. On the Problem of Sorting Railway Freight Cars , 2011 .
[22] Leo G. Kroon,et al. Efficient Circulation of Railway Rolling Stock , 2002, Transp. Sci..
[23] Mirka Miller,et al. The train marshalling problem , 2000, Discret. Appl. Math..
[24] Michael R. Bussieck,et al. Scheduling trams in the morning , 1999, Math. Methods Oper. Res..
[25] Clark Cheng,et al. Simulation and analysis of railroad hump yards in North America , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).
[26] T Albrecht. REDUCING POWER PEAKS AND ENERGY CONSUMPTION IN RAIL TRANSIT SYSTEMS BY SIMULTANEOUS TRAIN RUNNING TIME CONTROL , 2004 .
[27] Jian Liu,et al. Solving Real-Life Railroad Blocking Problems , 2007, Interfaces.
[28] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[29] Jean-François Cordeau,et al. A Benders Decomposition Approach for the Locomotive and Car Assignment Problem , 1998, Transp. Sci..
[30] M. Mongeau,et al. Mixed-Integer Linear Programming Formulations , 2015 .
[31] Luis Cadarso,et al. Robust rolling stock in rapid transit networks , 2011, Comput. Oper. Res..
[32] Sohail S. Chaudhry,et al. An integrated dispatching model for rail yards operations , 2003, Comput. Oper. Res..
[33] Stefan Irnich,et al. Shortest Path Problems with Resource Constraints , 2005 .
[34] Matthias Ehrgott,et al. An iterative approach to robust and integrated aircraft routing and crew scheduling , 2010, Comput. Oper. Res..
[35] Leo G. Kroon,et al. Shunting of Passenger Train Units: An Integrated Approach , 2006, Transp. Sci..
[36] Luis Cadarso,et al. Recovery of disruptions in rapid transit networks , 2013 .
[37] Cynthia Barnhart,et al. Constructing Railroad Blocking Plans to Minimize Handling Costs , 1998, Transp. Sci..
[38] David Pisinger,et al. A Branch-and-Price Framework for Railway Rolling Stock Rescheduling During Disruptions , 2014 .
[39] Peter Føns. Decision Support for Depot Planning in the Railway Industry , 2006 .
[40] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[41] Dennis Huisman,et al. Rescheduling in passenger railways: the rolling stock rebalancing problem , 2010, J. Sched..
[42] P. Howlett. An optimal strategy for the control of a train , 1990, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.
[43] Uwe T. Zimmermann,et al. Real-time dispatch of trams in storage yards , 2000, Ann. Oper. Res..
[44] Jacques Desrosiers,et al. Selected Topics in Column Generation , 2002, Oper. Res..
[45] Nejib Ben-Khedher,et al. Schedule Optimization at SNCF: From Conception to Day of Departure , 1998, Interfaces.
[46] David M. Ryan,et al. The train driver recovery problem - A set partitioning based model and solution method , 2010, Comput. Oper. Res..
[47] M. Lübbecke. Column Generation , 2010 .
[48] Deeparnab Chakrabarty,et al. Knapsack Problems , 2008 .
[49] Sara Gestrelius,et al. Optimisation of simultaneous train formation and car sorting at marshalling yards , 2013 .
[50] Tang Bing,et al. Energy Saving Train Control for Urban Railway Train with Multi-population Genetic Algorithm , 2009, 2009 International Forum on Information Technology and Applications.
[51] Lex Schrijver,et al. Minimum circulation of railway stock , 1993 .
[52] Vladimir Vacic,et al. VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .
[53] Guy Desaulniers,et al. An extended branch-and-bound method for locomotive assignment , 2003 .
[54] E R Kraft. PRIORITY-BASED CLASSIFICATION FOR IMPROVING CONNECTION RELIABILITY IN RAILROAD YARDS. PART I OF II: INTEGRATION WITH CAR SCHEDULING , 2002 .
[55] Sara Gestrelius,et al. Optimal Freight Train Classification using Column Generation , 2012, ATMOS.
[56] Jørgen Thorlund Haahr,et al. A Math-Heuristic Framework for the ROADEF/EURO Challenge 2014 , 2014 .
[57] Jean-François Cordeau,et al. SIMULTANEOUS LOCOMOTIVE AND CAR ASSIGNMENT AT VIA RAIL CANADA , 1998 .
[58] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[59] Leo Kroon,et al. Applying Operations Research techniques to planning of train shunting , 2003 .
[60] David Pisinger,et al. Simultaneously Recovering Rolling Stock Schedules and Depot Plans Under Disruption , 2015 .
[61] David Pisinger,et al. Algorithms for Knapsack Problems , 1995 .
[62] Matús Mihalák,et al. Shunting for Dummies: An Introductory Algorithmic Survey , 2009, Robust and Online Large-Scale Optimization.
[63] Phil Howlett,et al. Energy-efficient train control , 1994 .
[64] Bart De Schutter,et al. A survey on optimal trajectory planning for train operations , 2011, Proceedings of 2011 IEEE International Conference on Service Operations, Logistics and Informatics.
[65] Dennis Huisman,et al. Shunting of Passenger Train Units in a Railway Station , 2002, Transp. Sci..
[66] J. Desrosiers,et al. BRANCH-PRICE-AND-CUT ALGORITHMS , 2011 .
[67] Leo G. Kroon,et al. A rolling horizon approach for disruption management of railway rolling stock , 2012, Eur. J. Oper. Res..
[68] Balachandran Vaidyanathan,et al. The Locomotive Routing Problem , 2008, Transp. Sci..
[69] Thorsten Koch,et al. Branching rules revisited , 2005, Oper. Res. Lett..
[70] David S. Johnson,et al. Some simplified NP-complete problems , 1974, STOC '74.
[71] Sylvie Gélinas,et al. Locomotive assignment with heterogeneous consists at CN North America , 1997 .
[72] Jens Clausen,et al. Optimal Reinsertion of Cancelled Train Lines , 2006 .
[73] Paolo Toth,et al. Solving a real-world train-unit assignment problem , 2010, Math. Program..
[74] Lucas P. Veelenturf,et al. An overview of recovery models and algorithms for real-time railway rescheduling , 2014 .
[75] Masafumi Miyatake,et al. Application of dynamic programming to the optimization of the running profile of a train , 2004 .
[76] Julia Rieck,et al. Exact Methods for Resource Leveling Problems , 2015 .
[77] Jacques Desrosiers,et al. OPERATIONAL CAR ASSIGNMENT AT VIA RAIL CANADA , 2000 .
[78] Chung-Fu Chang,et al. Optimising train movements through coast control using genetic algorithms , 1997 .
[79] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[80] Jyh-Cherng Jong,et al. ALGORITHMS FOR GENERATING TRAIN SPEED PROFILES , 2005 .
[81] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[82] Markus Bohlin,et al. Optimized shunting with mixed-usage tracks , 2013 .
[83] Daniel Potthoff,et al. Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling , 2008, Transp. Sci..
[84] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.
[85] Jonatha Anselmi,et al. Optimization Techniques Applied to Railway Systems , 2013 .
[86] Christopher P. L. Barkan,et al. Lean Railroading for Improving Railroad Classification Terminal Performance , 2007 .
[87] Maria Grazia Speranza,et al. The locomotive assignment problem: a survey on optimization models , 2014, Int. Trans. Oper. Res..
[88] Gabriele Di Stefano,et al. A Graph Theoretical Approach To The Shunting Problem , 2004, Electron. Notes Theor. Comput. Sci..
[89] N. M. van Dijk,et al. Train Shunting: A Practical Heuristic Inspired by Dynamic Programming , 2006 .
[90] Peter Brucker,et al. Routing of Railway Carriages , 2003, J. Glob. Optim..
[91] Marc Peeters,et al. Circulation of railway rolling stock: a branch-and-price approach , 2003, Comput. Oper. Res..
[92] Jan Riezebos,et al. Case Study: Advanced Decision Support for Train Shunting Scheduling , 2010 .
[93] Tin Kin Ho,et al. Coast control for mass rapid transit railways with searching methods , 2004 .
[94] Giorgio Gallo,et al. Dispatching Buses in Parking Depots , 2001, Transp. Sci..
[95] Leo G. Kroon,et al. Rescheduling of Railway Rolling Stock with Dynamic Passenger Flows , 2010, Transp. Sci..
[96] Leo G. Kroon,et al. A rolling stock circulation model for combining and splitting of passenger trains , 2006, Eur. J. Oper. Res..
[97] Leo G. Kroon,et al. Allocation of Railway Rolling Stock for Passenger Trains , 2002, Transp. Sci..
[98] Hyun Jun Park,et al. An optimal automatic train operation (ATO) control using genetic algorithms (GA) , 1999, Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030).
[99] Shaofeng Lu,et al. Optimising power management strategies for railway traction systems , 2011 .
[100] Warren B. Powell,et al. From Single Commodity to Multiattribute Models for Locomotive Optimization: A Comparison of Optimal Integer Programming and Approximate Dynamic Programming , 2016, Transp. Sci..
[101] Luis Cadarso,et al. Robust routing of rapid transit rolling stock , 2010, Public Transp..
[102] Leo Kroon,et al. Rolling Stock Rescheduling in Passenger Railways , 2006 .
[103] Clark Cheng,et al. YardSim: A rail yard simulation framework and its implementation in a major railroad in the U.S. , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).
[104] Leo G. Kroon,et al. Railway Rolling Stock Planning: Robustness Against Large Disruptions , 2012, Transp. Sci..
[105] A. V. Dmitruk,et al. Solution problem of the energetically optimal control of the motion of a train by the maximum principle , 1987 .
[106] Guy Desaulniers,et al. Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches , 2007, Comput. Oper. Res..
[107] Dennis Huisman,et al. Algorithmic Support for Railway Disruption Management , 2011 .
[108] David Pisinger,et al. Train shunting at a workshop area , 2011 .
[109] Thomas Winter,et al. Online and Real-Time Dispatching Problems , 1999 .