[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Journal Information::
Articles archive::
Submission Instruction::
Submit article::
Site Facilities::
Contact us::
Google Scholar

Citation Indices from GS

AllSince 2015

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Search published articles ::
Showing 1 results for Niksirat

Dr. M. Niksirat,
Volume 9, Issue 1 (7-2018)

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.

Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.04 seconds with 27 queries by YEKTAWEB 4237