Assignment problems are very challenging combinatorial problem which are often used to compare the performance of various algorithms. In this paper, we are dealing with an interesting problem with respect to the transportation system of our country known as bus-driver assignment problem. The problem states that among different choices of the drivers, we have to assign drivers to the bus in the best possible way. The complexity of the problem is that the assignment must be the optimal one so that each bus has a driver and each driver drives a bus among their own choice. To solve this problem, we have used the well known Ford-Fulkerson and Edmond-karp algorithm. In our experimental analysis, we have compared the performance of these two algorithms and also shown the efficiency of these algorithms in solving such kinds of assignment problems.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Efficient Approach to Solve Bus-Driver Assignment Problem




    Publication date :

    2019-09-01


    Size :

    1084722 byte



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A simplicial decomposition algorithm to solve the traffic assignment problem

    Lee, S. / Universities Transport Study Group | British Library Conference Proceedings | 1992



    Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem

    Xu, Xiangdong / Chen, Anthony / Zhou, Zhong et al. | Transportation Research Record | 2012