An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem

详细信息    查看全文

• 作者：David Canca^a ; ^dco@us.es ; Alicia De-Los-Santos^b ; ^{aliciasantos@us.es} ; Gilbert Laporte^c ; ^{gilbert.laporte@cirrelt.ca} ; Juan A. Mesa^b ; ^jmesa@us.es
• 关键词：Railway rapid transit ; Network design ; Line planning ; Adaptive large neighborhood search
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：1-14
• 全文大小：2974 K
• 卷排序：78

文摘

We model and solve the Railway Rapid Transit Network Design and Line Planning (RRTNDLP) problem. We take into account costs relative to the network construction, fleet acquisition, operation, rolling stock and personnel. We assume the existence of an alternative transport mode competing with the railway for each origin-destination pair. We develop an Adaptive Large Neighborhood Search algorithm, which simultaneously solve the network design and line planning problems. The ALNS performance is compared with state-of-the-art commercial solvers. We apply the ALNS to areal-size instance concerning the design of a railway rapid transit network in the city of Seville.