An exact algorithm for multiple depot bus scheduling Export

@article{forbes_1994, abstract = {In this paper we 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 obtaine 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 obtaine the optimal integer solution. This technique is then used to solve exactly problems much greater than any previously reported technique. Results are presented for problems with up to 600 trips and 3 depots.}, author = {Forbes, M.}, citeulike-article-id = {6037507}, day = {06}, issn = {03772217}, journal = {European Journal of Operational Research}, keywords = {15094, mdvsp, optimization, scheduling, transit}, month = {January}, number = {1}, pages = {115--124}, posted-at = {2009-10-29 21:56:03}, priority = {2}, title = {An exact algorithm for multiple depot bus scheduling}, volume = {72}, year = {1994} }

TY - JOUR ID - forbes_1994 L3 - citeulike-article-id:6037507 N2 - In this paper we 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 obtaine 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 obtaine the optimal integer solution. This technique is then used to solve exactly problems much greater than any previously reported technique. Results are presented for problems with up to 600 trips and 3 depots. IS - 1 JF - European Journal of Operational Research SN - 03772217 EP - 124 TI - An exact algorithm for multiple depot bus scheduling VL - 72 SP - 115 KW - 15094 KW - mdvsp KW - optimization KW - scheduling KW - transit AU - Forbes, M PY - 1994/01/06/ ER -