Computer-Aided Transit Scheduling: Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport
Joachim R. Daduna, Isabel Branco, Jose M.P. Paixao
Springer Science & Business Media, Dec 6, 2012 - Mathematics - 374 pages
This proceedings volume consists of papers presented at the Sixth International Workshop on Computer-Aided Scheduling of Public Transpon, which was held at the Fund~lio Calouste Gulbenkian in Lisbon from July 6th to 9th, 1993. In the tradition of alternating Workshops between North America and Europe - Chicago (1975), Leeds (1980), Montreal (1983), Hamburg (1987) and again Montreal (1990), the European city of Lisbon was selected as the venue for the Workshop in 1993. As in earlier Workshops, the central theme dealt with vehicle and duty scheduling problems and the employment of operations-research-based software systems for operational planning in public transport. However, as was initiated in Hamburg in 1987, the scope of this Workshop was broadened to include topics in related fields. This fundamental alteration was an inevitable consequence of the growing demand over the last decade for solutions to the complete planning process in public transport through integrated systems. Therefore, the program of this workshop included sections which dealt with scheduling problems and computerized systems for operational planning as well as sections on network planning and data management.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
application approach assigned block branch and bound bus links bus schedule Carraresi column constraints corresponding cost covering crew scheduling problems Crew-Opt CVTP Daduna deadheading deficit function defined departure depot Desrochers developed diagrams dispatching control efficient estimator feasible duties feasible solution formulation genetic algorithms graph G greedy algorithm headways heuristic IMPACS integer integer linear programming integer programming interactive iteration linear programming lines London Underground lower bound maximum meal break method minimize nodes number of vehicles objective function obtained Operations Research optimal solution overtime parameters passengers peak pieces planning possible procedure public transport random relief opportunities roster Rousseau route search space shifts shortest path shortest path problem simulated annealing simulation solving synchronization tabu search timetable traffic transfer trips variables vehicle of type vehicle scheduling problem vehicle type Wren zone