An optimization model for line planning and timetabling in automated urban metro subway networks

In this paper we present a Mixed Integer Nonlinear Programming model that we developed as part of a pilot study requested by the R&D company Metrolab in order to design tools for finding solutions for line planning and timetable situations in automated urban metro subway networks. Our model inco...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2019-03
Main Authors: Blanco, Víctor, Conde, Eduardo, Hinojosa, Yolanda, Puerto, Justo
Format: Article
Language:English
Subjects:
Automation
Heuristic methods
Mathematical programming
Mixed integer
Nonlinear programming
Optimization
Passenger trains
Public transportation
R&D
Research & development
Subway stations
Subways
Time dependence
Timetables
Transfer stations
Transportation networks
Transportation systems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we present a Mixed Integer Nonlinear Programming model that we developed as part of a pilot study requested by the R&D company Metrolab in order to design tools for finding solutions for line planning and timetable situations in automated urban metro subway networks. Our model incorporates important factors in public transportation systems from both, a cost-oriented and a passenger-oriented perspective, as time-dependent demands, interchange stations, short-turns and technical features of the trains in use. The incoming flows of passengers are modeled by means of piecewise linear demand functions which are parameterized in terms of arrival rates and bulk arrivals. Decisions about frequencies, train capacities, short-turning and timetables for a given planning horizon are jointly integrated to be optimized in our model. Finally, a novel Math-Heuristic approach is proposed to solve the problem. The results of extensive computational experiments are reported to show its applicability and effectiveness to handle real-world subway networks
ISSN:2331-8422
DOI:10.48550/arxiv.1903.08617