[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
:: Volume 9, Issue 1 (7-2018) ::
IJOR 2018, 9(1): 49-61 Back to browse issues page
Efficient Algorithm Based on Network Flows for Two-Depot Bus Scheduling Problem
M. Niksirat Dr.
Birjand University of Technology , niksirat@birjandut.ac.ir
Abstract:   (333 Views)
In this paper bus scheduling problem under the constraints that the total number of buses needed to perform all trips is known in advance and the energy level of buses is limited, is considered. Each depot has a different time processing cost. The goal of this problem is to find a minimum cost feasible schedule for buses. A mathematical formulation of the problem is developed. When there are two depots, a polynomial time algorithm is developed for the problem and theoretical results about the complexity and correctness of the algorithm is presented. Also, several examples are introduced for illustrating validity of the algorithm.
Keywords: Bus scheduling problem, Minimum cost network flow, Polynomial time algorithm, Fixed job scheduling.
Full-Text [PDF 455 kb]   (178 Downloads)    
Type of Study: Original | Subject: Mathematical Modeling and Applications of OR
Received: 2017/04/1 | Accepted: 2018/03/3 | Published: 2018/08/5
Send email to the article author

Add your comments about this article
Your username or Email:


XML     Print

Volume 9, Issue 1 (7-2018) Back to browse issues page
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.07 seconds with 30 queries by YEKTAWEB 4237