Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your 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
DOI: 10.2307/2584590
Stable URL: http://www.jstor.org/stable/2584590
Page Count: 12
  • Subscribe ($19.50)
  • Cite this Item
A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[415]
    [415]
  • Thumbnail: Page 
416
    416
  • Thumbnail: Page 
417
    417
  • Thumbnail: Page 
418
    418
  • Thumbnail: Page 
419
    419
  • Thumbnail: Page 
420
    420
  • Thumbnail: Page 
421
    421
  • Thumbnail: Page 
422
    422
  • Thumbnail: Page 
423
    423
  • Thumbnail: Page 
424
    424
  • Thumbnail: Page 
425
    425
  • Thumbnail: Page 
426
    426