You are not currently logged in.
Access JSTOR through your library or other institution:
A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas
José Vasconcelos Ferreira and Rui Campos Guimarães
The Journal of the Operational Research Society
Vol. 46, No. 4 (Apr., 1995), pp. 415-426
Stable URL: http://www.jstor.org/stable/2584590
Page Count: 12
You can always find the topics here!Topics: Heuristics, Tours, Workloads, Algorithms, Sequencing, Scheduling, Traveling salesman problem, Operations research, Public transportation, Vehicles
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
The paper addresses one aspect of the rostering problem posed to the public transport company operating in Porto, Portugal. The specific problem dealt with in this paper is that of sequencing the duties within each rota (rotating schedule) so as to minimize the variance of the rest periods between successive duties while satisfying constraints on their minimum value. This problem is formulated as a travelling salesman problem. Solutions derived from two heuristics are compared with the optimal ones.
The Journal of the Operational Research Society © 1995 Operational Research Society