An exact algorithm for multiple depos bus scheduling

An exact algorithm for multiple depos bus scheduling

0.00 Avg rating0 Votes
Article ID: iaor19971881
Country: Netherlands
Volume: 72
Issue: 1
Start Page Number: 115
End Page Number: 124
Publication Date: Jan 1994
Journal: European Journal of Operational Research
Authors: , ,
Keywords: transportation: road, Transportation: Road
Abstract:

In this paper the authors present an exact algorithm for solving the multiple depot 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 relaxation, a multi-commodity network flow problem, which is solved using dual simplex. Branch and bound is then used to obtain the optimal integer solution. This technique is then used to solve exact problems much greater than any previously reported technique. Results are presented for problems with up to 600 trips and 3 depots.

Reviews

Required fields are marked *. Your email address will not be published.