|
Efficient Algorithm Based on Network Flows for Two-Depot Bus Scheduling Problem
|
M. Niksirat *    |
| Birjand University of Technology , niksirat@birjandut.ac.ir |
|
|
Abstract: (6766 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]
(10297 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 |
|
|
|
