APS-CR: Assignment Problem Solver for Cost Minimization of Crew Routes

Abstract

In this paper, crew scheduling problem is described on operational roadways. During our day-to-day operations, generalized monthly roadways, crew members are associated to solve the crew problems, which requires covering of all buses at minimal cost and also maximal profit. For selected crew members to prepare a simplified pairing, and classifying crew pairing problems in a constructive way, monthly assignments must be followed. In this work, we proposed the various problems in which the bus schedule and crew schedule are fixed in an optimized way by giving the input data. Hungarian method is applied as a case study that discusses the different routes and assignment problem solvation process, adopted by the routes from given sources to given destinations. From the case study taken, the minimum lay over time is found to be 33.30 Hrs.