جلد 28، شماره 2 - ( 3-1396 )                   جلد 28 شماره 2 صفحات 113-128 | برگشت به فهرست نسخه ها



DOI: 10.22068/ijiepr.28.2.113

XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Nasirian F, Ranjbar M. Public transport fleet scheduling for minimizing total transfer waiting time. IJIEPR. 2017; 28 (2) :113-128
URL: http://ijiepr.iust.ac.ir/article-1-721-fa.html
Public transport fleet scheduling for minimizing total transfer waiting time. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1396; 28 (2) :113-128

URL: http://ijiepr.iust.ac.ir/article-1-721-fa.html


چکیده:   (360 مشاهده)

Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables. In this paper, we formulate the problem as a mixed integer linear programming model and solve it using ILOG CPLEX solver. For large-scale test instances, we develop a metaheuristic based on the scatter search algorithm to obtain good solutions in a reasonable CPU run times. Finally, in the computational section, the efficiency of the proposed model and developed algorithm are compared with the existing results in the literature on a real railway network.

متن کامل [PDF 899 kb]   (146 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: مدیریت عملیات
دریافت: ۱۳۹۵/۱۲/۱۶ | پذیرش: ۱۳۹۶/۴/۲۱ | انتشار: ۱۳۹۶/۴/۲۴

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb