Thomas Schlechte , Ralf Borndörfer , Jonas Denißen , Simon Heller , Torsten Klug , Michael Küpper , Niels Lindner , Markus Reuther , Andreas Söhlke , William Steadman
{"title":"移动街区系统的时间表优化","authors":"Thomas Schlechte , Ralf Borndörfer , Jonas Denißen , Simon Heller , Torsten Klug , Michael Küpper , Niels Lindner , Markus Reuther , Andreas Söhlke , William Steadman","doi":"10.1016/j.jrtpm.2022.100315","DOIUrl":null,"url":null,"abstract":"<div><p><span>We present an optimization model which is capable of routing and ordering trains on a microscopic level under a moving block regime. Based on a general timetabling definition (</span><em>GTTP</em><span>) that allows the plug in of arbitrarily detailed methods to compute running and headway times, we describe a layered graph approach using velocity expansion, and develop a mixed integer linear programming<span> formulation. Finally, we present promising results for a German corridor scenario with mixed traffic, indicating that applying branch-and-cut to our model can solve reasonably sized instances with up to a hundred trains to optimality.</span></span></p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"22 ","pages":"Article 100315"},"PeriodicalIF":2.7000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Timetable optimization for a moving block system\",\"authors\":\"Thomas Schlechte , Ralf Borndörfer , Jonas Denißen , Simon Heller , Torsten Klug , Michael Küpper , Niels Lindner , Markus Reuther , Andreas Söhlke , William Steadman\",\"doi\":\"10.1016/j.jrtpm.2022.100315\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We present an optimization model which is capable of routing and ordering trains on a microscopic level under a moving block regime. Based on a general timetabling definition (</span><em>GTTP</em><span>) that allows the plug in of arbitrarily detailed methods to compute running and headway times, we describe a layered graph approach using velocity expansion, and develop a mixed integer linear programming<span> formulation. Finally, we present promising results for a German corridor scenario with mixed traffic, indicating that applying branch-and-cut to our model can solve reasonably sized instances with up to a hundred trains to optimality.</span></span></p></div>\",\"PeriodicalId\":51821,\"journal\":{\"name\":\"Journal of Rail Transport Planning & Management\",\"volume\":\"22 \",\"pages\":\"Article 100315\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Rail Transport Planning & Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S221097062200018X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2022/3/30 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"TRANSPORTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Rail Transport Planning & Management","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221097062200018X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/3/30 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
We present an optimization model which is capable of routing and ordering trains on a microscopic level under a moving block regime. Based on a general timetabling definition (GTTP) that allows the plug in of arbitrarily detailed methods to compute running and headway times, we describe a layered graph approach using velocity expansion, and develop a mixed integer linear programming formulation. Finally, we present promising results for a German corridor scenario with mixed traffic, indicating that applying branch-and-cut to our model can solve reasonably sized instances with up to a hundred trains to optimality.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
