Volume 28, Number 2 (IJIEPR 2017)                   IJIEPR 2017, 28(2): 113-128 | Back to browse issues page



DOI: 10.22068/ijiepr.28.2.113

XML 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-en.html

Associate professor Ferdowsi University of Mashhad , m_ranjbar@um.ac.ir
Abstract:   (166 Views)

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.

Full-Text [PDF 899 kb]   (58 Downloads)    
Type of Study: Research | Subject: Operations Managment
Received: 2017/03/6 | Accepted: 2017/07/12 | Published: 2017/07/15

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


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

Designed & Developed by : Yektaweb