دانلود Exact formulations and algorithm for the train timetabling problem with dynamic demand

ترجمه مقاله Exact formulations and algorithm for the train timetabling problem with dynamic demand
قیمت : 255,000 ریال
شناسه محصول : 2009064
نویسنده/ناشر/نام مجله : Computers & Operations Research
سال انتشار: 2014
تعداد صفحات انگليسي : 9
نوع فایل های ضمیمه : Pdf+Word
حجم فایل : 638 Kb
کلمه عبور همه فایلها : www.daneshgahi.com
عنوان انگليسي : Exact formulations and algorithm for the train timetabling problem with dynamic demand

چکیده

Abstract

In this paper we study the design and optimization of train timetabling adapted to a dynamic demand environment. This problem arises in rapid train services which are common in most important cities. We present three formulations for the problem, with the aim of minimizing passenger average waiting time. The most intuitive model would consider binary variables representing train departure times but it yields to non-linear objective function. Instead, we introduce flow variables, which allow a linear representation of the objective function. We provide incremental improvements on these formulations, which allows us to evaluate and compare the benefits and disadvantages of each modification. We present a branch-and-cut algorithm applicable to all formulations. Through extensive computational experiments on several instances derived from real data provided by the Madrid Metropolitan Railway, we show the advantages of designing a timetable adapted to the demand pattern, as opposed to a regular timetable. We also perform an extensive computational comparison of all linear formulations in terms of size, solution quality and running time.

Keywords: Train timetabling Dynamic demand Regular timetable Exact algorithm Branch-and-cut
این برای گرایش های: کلیه گرایش ها، کاربرد دارد. همچنین این در گرایش های: کلیه گرایش ها، می تواند کاربرد داشته باشد. [ برچسب: ]

Skip Navigation Links