Scheduling of Toll Collectors

J. L. Byrne and R. B. Potts
Additional contact information
J. L. Byrne: University of Adelaide, Adelaide, South Australia
R. B. Potts: University of Adelaide, Adelaide, South Australia

Transportation Science, 1973, vol. 7, issue 3, 224-245

Abstract: The problem of rostering toll collectors for a toll facility such as a bridge, tunnel, or expressway is formulated as an integer program. The working regulations for full-time and part-time shifts give special structure to the program. An eight phase algorithm is described that exploits this special structure and enables variables to be grouped together and the integer constraints successively introduced. The algorithm has been tested for a wide variety of practical schedule problems and has proved successful in obtaining acceptable schedules in comparatively short computer run times.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.7.3.224 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:7:y:1973:i:3:p:224-245

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().