MILP formulations and a TS algorithm for reliable last train timetabling with uncertain transfer flows
暂无分享,去创建一个
[1] Rasaratnam Logendran,et al. An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes , 2017, Comput. Oper. Res..
[2] Bart De Schutter,et al. Robust Model Predictive Control for Train Regulation in Underground Railway Transportation , 2016, IEEE Transactions on Control Systems Technology.
[3] Gilbert Laporte,et al. Combining multicriteria analysis and tabu search for dial-a-ride problems , 2013 .
[4] Anthony Chen,et al. Bi-objective programming approach for solving the metro timetable optimization problem with dwell time uncertainty , 2017 .
[5] Ziyou Gao,et al. A case study on the coordination of last trains for the Beijing subway network , 2015 .
[6] Gilbert Laporte,et al. Single-line rail rapid transit timetabling under dynamic passenger demand , 2014 .
[7] Kjetil Fagerholt,et al. A tabu search heuristic for ship routing and scheduling , 2010, J. Oper. Res. Soc..
[8] Elise Miller-Hooks,et al. Freight train scheduling with elastic demand , 2010 .
[9] Janny Leung,et al. Optimizing Timetable Synchronization for Rail Mass Transit , 2008, Transp. Sci..
[10] Xinfeng Yang,et al. Research on the Multi-objective Transfer Coordination Optimization of Urban Rail Transit Trains ⋆ , 2015 .
[11] Xiaoning Zhu,et al. A practical model for last train rescheduling with train delay in urban railway transit networks , 2015 .
[12] M. J Dorfman,et al. Scheduling trains on a railway network using a discrete event model of railway traffic , 2004 .
[13] S Oettich,et al. A NEW INTEGRATED APPROACH TO DYNAMIC SCHEDULE SYNCHRONIZATION AND ENERGY-SAVING TRAIN CONTROL , 2002 .
[14] Fang Zhao,et al. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks , 2008, Eur. J. Oper. Res..
[15] Ziyou Gao,et al. Timetable coordination of first trains in urban railway network: A case study of Beijing , 2016 .
[16] Thomas Schlechte,et al. A direct comparison of physical block occupancy versus timed block occupancy in train timetabling formulations , 2013 .
[17] Ulrich Derigs,et al. A simple and efficient tabu search heuristic for solving the open vehicle routing problem , 2009, J. Oper. Res. Soc..
[18] Fred W. Glover,et al. Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs , 2013, Eur. J. Oper. Res..
[19] Xia Yang,et al. Coordination Optimization of the First and Last Trains' Departure Time on Urban Rail Transit Network , 2013 .
[20] Massoud Bazargan-Lari. Flexible versus fixed timetabling: a case study , 2004, J. Oper. Res. Soc..
[21] Christian Liebchen,et al. The First Optimized Railway Timetable in Practice , 2008, Transp. Sci..
[22] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[23] Ziyou Gao,et al. Train Timetable Problem on a Single-Line Railway With Fuzzy Passenger Demand , 2009, IEEE Transactions on Fuzzy Systems.