Computer-Aided Transit Scheduling: Proceedings, Cambridge, MA, USA, August 1997
Nigel H.M. Wilson
Springer Berlin Heidelberg, Jun 21, 1999 - Computers - 464 pages
This proceedings volume consists of papers presented at the Seventh International Workshop on Computer-Aided Scheduling of Pllblic Transport, which was held at th th the Massachusetts Institute of Technology from August 5 to 8 , 1997. In the tradition of alternating Workshops between North American and Europe - Chicago (1975), Leeds (1980), Montreal (1983), Hamburg (1986), Montreal (1990), and Lisbon (1993), Cambridge (Massachusetts, USA) was selected for the Workshop in 1997. As in earlier workshops, the central theme dealt with vehicle and crew scheduling problems and the development of software systems incorporating operations research techniques for operational planning in public transport. However, following the trend that started in Hamburg in 1987, the scope of this Workshop was broadened to include topics in related fields. Two trends underlie this. First, the recognition that the core scheduling issues in public transport have important common elements with other application areas in which extensive work is also underway, and that it is vital to learn from these other initiatives. Second, while scheduling is indeed a core problem in public transport planning, and has shown the first and greatest benefits from computer application, it is intimately related to the preceding tasks in the planning hierarchy, such as service design, and the following tasks such as operations control and public information.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Crew Pairing for a Regional Carrier
An Improved ILP System for Driver Scheduling
An Exact Algorithm for the Vehicle and
16 other sections not shown
Other editions - View all
algorithm approach arcs arrival Berlin Berlin-Spandau block BOOST branch and bound branch-and-cut bus schedule buses cluster column Computer-Aided constraints corresponding cost CPLEX crew scheduling problem Daduna deadheading defined delay departure depot developed dh-trip dispatching driver scheduling duties feasible solution flow formulation headway heuristic holding impact set implemented integer linear programming integer solution iterations Lagrangean latK linear programming linear relaxation lower bound LP relaxation master problem mathematical MDVSP meal break method minimize minimum minutes node number of shifts objective function Operations Research optimal solution pairing partitioning problems passenger pieces possible procedure public transport reduced relief opportunities roster route runs scenario Sept-Iles sequence service network design set covering set covering problem short-turning shortest path shortest path problem solved station strategies subproblem subset Table Telebus timetable TRACS traffic train segment trips University of Leeds vehicle and crew waiting