AN EXACT ALGORITHM FOR MULTIPLE DEPOT BUS SCHEDULING

In this paper we present an exact algorithm for solving the multiple d epot bus scheduling problem. The algorithm uses two well known linear programming relaxations of the problem. The first, a pure network flow problem, is used to obtain a dual feasible solution to the second rel axation, a multi-commodity network flow problem, which is solved using dual simplex. Branch and bound is then used to obtain the optimal int eger solution. This technique is then used to solve exactly problems m uch greater than any previously reported technique. Results are presen ted for problems with up to 600 trips and 3 depots.