کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1132376 955774 2011 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Optimizing the demand captured by a railway system with a regular timetable
موضوعات مرتبط
علوم انسانی و اجتماعی علوم تصمیم گیری علوم مدیریت و مطالعات اجرایی
پیش نمایش صفحه اول مقاله
Optimizing the demand captured by a railway system with a regular timetable
چکیده انگلیسی

The railway systems in various European countries adopt regular timetables, in which the trains arrive and depart at constant intervals. In fact, their simple structure provides several advantages both to the passengers and to the management of the service. The design of such timetables has recently received a certain attention in the literature, but the standard model aims to optimize the service for a fixed demand. We relax this unrealistic assumption, taking into account the reciprocal influence between the quality of the timetable and the amount of transport demand captured by the railway. This results into a mixed-integer non linear model with a non-convex continuous relaxation. We solve it by a branch-and-bound algorithm based on a piecewise-linear overestimate of the objective function and a heuristic algorithm which iteratively applies the standard fixed-demand model and a demand-estimation model, feeding each one with data based on the solution obtained from the other one at the previous iteration. The computational results presented concern both random instances and a real-world regional network located in Northwestern Italy.

Research highlights
► Ignoring the feed-back between transport demand and offer may engender bad decision policies.
► Combining the state-of-the-art models for transport demand and offer leads to a MINLP problem.
► This problem is solved by branch-and-bound through a piecewise-linear overestimate of the demand model.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part B: Methodological - Volume 45, Issue 2, February 2011, Pages 430–446
نویسندگان
, ,