论文信息 - A LAGRANGIAN RELAXATION BASED HEURISTIC FOR THE URBAN TRANSIT CREW SCHEDULING PROBLEM. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING

A LAGRANGIAN RELAXATION BASED HEURISTIC FOR THE URBAN TRANSIT CREW SCHEDULING PROBLEM. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING

Several researchers have approached the transit crew scheduling problem by decomposing it into a shortest path problem and a matching problem. We present an approach based on this decomposition which iterates between the solution of a shortest path problem and the solution of a matching problem. The objective function for the shortest path problem is derived by considering Lagrangian penalties associated with the perfectly matchable subgraph inequalities. This approach is validated on sample problems from the Washington Metropolitan Area Transit Authority (WMATA).

M O Ball | H Benoit-Thompson | M. Ball | H. Benoit-Thompson

[1] Giorgio Gallo,et al. Network models for vehicle and crew scheduling , 1984 .

[2] P M Hildyard,et al. ADVANCES IN COMPUTER-ASSISTED RUNCUTTING IN NORTH AMERICA. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[3] Jean-Marc Rousseau,et al. ENHANCEMENTS TO THE HASTUS CREW SCHEDULING ALGORITHM. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[4] G. Mitra,et al. Computer Scheduling of Public Transport , 1982 .

[5] L K Luedtke. RUCUS II: A REVIEW OF SYSTEM CAPABILITIES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[6] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[7] Lawrence Bodin,et al. A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[8] D. I. Calvert,et al. Computer Scheduling of Public Transport 2 , 1986 .

[9] J M Rousseau,et al. HASTUS I: A MATHEMATICAL PROGRAMMING APPROACH TO THE BUS DRIVER SCHEDULING PROBLEM. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[10] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[11] Lawrence Bodin,et al. ENHANCEMENTS TO THE RUCUS-II CREW SCHEDULING SYSTEM. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[12] Egon Balas,et al. The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.