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.
An Efficient Approach to Solve Bus-Driver Assignment Problem
01.09.2019
1084722 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A simplicial decomposition algorithm to solve the traffic assignment problem
British Library Conference Proceedings | 1992
|DOAJ | 2017
|Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem
Transportation Research Record | 2012
|Combining column generation and constraint programming to solve the tail assignment problem
Springer Verlag | 2008
|Path-Based Algorithms to Solve C-Logit Stochastic User Equilibrium Assignment Problem
Online Contents | 2012
|