High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Resolving Problem of Bus Driver Scheduling:


kuvadiya umesh c. , L.D. college of engineering; DR. P. J. GUNDALIYA , L.E. Engineering College, Morbi, Gujarat, India


Bus Driver Scheduling, Work Hour, Total Idle Time, Least Layover Time, Programming Code, Independence Constrain, Shift, Trip, Algorithm, Initial Solution.


The bus driver scheduling is an important part of every transportation system. This research study consists the solution of bus driver scheduling problem at A.M.T.S. bus depot, in Ahmedabad City of Gujarat. There are many problems coming during preparation of bus driver scheduling. In the every transportation system there is number of regulations related to the crew scheduling; like maximum work hour, least layover time, trip duration, peak hour factor, idle time, break period, etc. Thus this study considers the independence constrain for development of mathematical model of such scheduling problem. This independence constrain is basis of declaration to meet the work intensity of driver, the time shift of trip & effects of peak and off-peak hours on trip duration. Main objective of this mathematical model is to minimize the total idle time, for which the algorithm is prepared to generate the initial solution based on the ordered sequence. The result showed that the proposed mathematical model for bus driver scheduling in this paper can give the effective solution of bus driver scheduling by effective utilization of crew scheduling which leads to minimize the total idle time and hence efficient utilization of all resources available to A.M.T.S. depot, Ahmedabad, Gujarat.

Other Details

Paper ID: IJSRDV2I3199
Published in: Volume : 2, Issue : 3
Publication Date: 01/06/2014
Page(s): 1247-1253

Article Preview

Download Article