Skip to main content
SpringerLink
Log in

Heuristics Ancient and Modern: Transport Scheduling Through the Ages

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Heuristics which have been developed for transport scheduling over a lengthy period starting in 1960 are presented. They are generated in response to requirements to solve practical problems, and most are now in regular use by bus and train companies. Mathematical programming models have been formulated for some of the problems, but have been inappropriate on their own; in some cases, heuristics have led to a reduced problem which has then been solved by integer linear programming. The paper is designed to illustrate the development of heuristics for a range of related problem areas over nearly forty years. It explores the relationships between heuristics and other approaches and emphasises the need to convince users of the suitability of the overall system. Where appropriate, indications are given of difficulties in achieving practical implementation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Al-Amin, M., D. Noble, and M. Forbes. (1997). “Locomotive Rostering,” paper presented at the 1997 Meeting of the Asian-Pacific Operations Research Society (APORS), Melbourne, Australia.

  • Barr, Richard S., Bruce L. Golden, James P. Kelly, Mauricio G.C. Resende, and William R. Stewart. (1995). “Designing and Reporting on Computational Experiments with Heuristic Methods,” Journal of Heuristics1, 9-32.

    Google Scholar 

  • Bennett, Brian T. and Renfrey B. Potts. (1968). “Rotating Roster for a Transit System,” Transpn. Sci.2, 14-34.

    Google Scholar 

  • Daduna, Joachim R. and Miodrag Mojsilovic. (1988). “Computer-Aided Vehicle and Duty Scheduling Using the HOT Programme System.” In Joachim R. Daduna and Anthony Wren (eds.), Computer-Aided Transit Scheduling. Berlin: Springer-Verlag, pp. 133-146.

    Google Scholar 

  • Dorigo, Marco, V. Maniezo, and A. Colorni. (1996). “The Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Trans. on Systems, Man and CyberneticsB26, 1-13.

    Google Scholar 

  • Elias, Samy E.G. (1964). “The Use of Digital Computers in the Economic Scheduling for Both Man and Machine in Public Transportation. Kansas State University Bulletin, Special Report49.

  • Fores, Sarah. (1996). “Column Generation Approaches to Bus Driver Scheduling.” Ph.D. Thesis, University of Leeds.

  • Fores, Sarah, Leslie G. Proll, and Anthony Wren. (1998). “An Improved ILP System for Driver Scheduling.” In N.H.M. Wilson (ed.), Computer-Aided Scheduling of Public Transport. Springer (to appear).

  • Foster, Brian A. and David M. Ryan. (1976). “An Integer Programming Approach to the Vehicle Scheduling Problem,” Opl. Res. Q.27, 367-384.

    Google Scholar 

  • Gillett, B.C. and L.R. Miller. (1974). “A Heuristic Algorithm for the Vehicle Dispatch Problem,” Opns. Res.22, 340-349.

    Google Scholar 

  • Glover, F., D. Karney, D. Klingman, and A. Napier. (1974). “A Computational Study on Start Procedures, Basis Change Criteria and Solution Algorithms for Transportation Problems,” Man. Sci.20, 793-813.

    Google Scholar 

  • Glover, F. and C. McMillan. (1986). “The General Employee Scheduling Problem: An Integration of Management Science and Artificial Intelligence,” Computers and Operations Research13, 563-593.

    Google Scholar 

  • Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers.

  • Golden, B., E. Wasil, J. Kelly, and R. Chao. (1998). “The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results.” In T.G. Crainic and G. Laporte (eds.), Fleet Management and Logistics. Kluwer (to appear).

  • Grant, T.J. (1986). “Lessons for O.R. from A.I.: A Scheduling Case Study,” J. Opl. Res. Soc.37, 41-57.

    Google Scholar 

  • Hooker, J.N. (1995). “Testing Heuristics: We Have It All Wrong,” Journal of Heuristics1, 33-42.

    Google Scholar 

  • Kwan, Ann S.K., Raymond S.K. Kwan, Margaret E. Parker, and Anthony Wren. (1996). “Producing Train Driver Shifts By Computer.” In J. Allen, C.A. Brebbia, R.J. Hill, G. Sciutto and S. Sone (eds.), Computers in Railways V, Vol.1: Railway Systems Management. Southampton: Computational Mechanics Publications, pp. 359-370.

    Google Scholar 

  • Kwan, Ann S.K., Raymond S.K. Kwan, Margaret E. Parker, and Anthony Wren. (1998a). “Producing Train Driver Schedules Under Different Operating Strategies.” In N.H.M. Wilson (ed.), Computer-Aided Scheduling of Public Transport. Springer (to appear).

  • Kwan, Ann S.K., Raymond S.K. Kwan, and Anthony Wren. (1998b). “Driver Scheduling Using Genetic Algorithms With Embedded Combinatorial Traits.” In N.H.M. Wilson (ed.), Computer-Aided Scheduling of Public Transport. Springer (to appear).

  • Kwan, Raymond S.K. and Anthony Wren. (1996). “Hybrid Genetic Algorithms for Bus Driver Scheduling.” In L. Bianco and P. Toth (eds.), Advanced Methods in Transportation Analysis. Springer, pp. 609-619.

  • Laporte, Gilbert. (1991). “The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms.” Université de Montréal Centre de Recherche sur les Transports, Publication # 745.

  • Mackenzie, H.J. (1997). “Issues in the Design and Implementation of a Generalised Rostering and Scheduling System,” paper presented at the 1997 Meeting of the Asian-Pacific Operations Research Society (APORS), Melbourne, Australia.

  • Manington, Barbara and Anthony Wren. (1975). “A General Computer Method for Bus Crew Scheduling.” Preprints of International Workshop on Urban Passenger Vehicle and Crew Scheduling, Chicago (49 pp.).

  • Manington, Philip D. and Anthony Wren. (1975). “Experiences With a Bus Scheduling Algorithm Which Saves Vehicles.” Pre-prints of International Workshop on Urban Passenger Vehicle and Crew Scheduling, Chicago (25 pp.).

  • Mueller-Merbach, Heiner. (1974). “Heuristic Methods: Structures, Applications, Computational Experience.” In R. Cottle and J. Krarup (eds.), Optimisation Methods for Resource Allocation. English Universities Press, pp. 401-416.

  • Parker, Margaret E. and Barbara M. Smith. (1981). “Two Approaches to Computer Crew Scheduling.” In Anthony Wren (ed.), Computer Scheduling of Public Transport.Amsterdam: North-Holland, pp. 193-222.

  • Rochat, Y. and F. Semet. (1994). “A Tabu Search Approach for Delivering Pet Food and Flour,” J. Opl. Res. Soc.45, 1233-1246.

    Google Scholar 

  • Rousseau, Jean-Marc and Jean-Yves Blais. (1985). “HASTUS: An Interactive System for Buses and Crew Scheduling.” In Jean-Marc Rousseau (ed.), Computer Scheduling of Public Transport-2. Amsterdam: North-Holland, pp. 45-60.

  • Smith, Barbara M. and Anthony Wren. (1981). “VAMPIRES and TASC:Two Successfully Applied Bus Scheduling Programs.” In Anthony Wren (ed.), Computer Scheduling of Public Transport.Amsterdam: North-Holland, pp. 97-124.

  • Smith, Barbara M. (1986). “Bus Crew Scheduling Using Mathematical Programming.” Ph.D. Thesis, University of Leeds.

  • Smith, Barbara M. (1988). “IMPACS: A Bus Crew Scheduling System Using Linear Programming,” Math. Prog.42, 181-187.

    Google Scholar 

  • Smith, Barbara M. and Anthony Wren. (1988). “A Bus Crew Scheduling System Using a Set Covering Formulation,” Transpn. Res.22A, 97-108.

    Google Scholar 

  • Stern, Helman I. and Avishai Ceder. (1983). “An Improved Lower Bound to the Minimum Fleet Size Problem,” Transpn. Sci.17, 471-477.

    Google Scholar 

  • Willers, W. Philip. (1995). “Improved Algorithms for Bus Crew Scheduling.” Ph.D. Thesis, University of Leeds.

  • Wolfenden, Keith and Anthony Wren. (1966). “Locomotive Scheduling by Computer.” Proceedings of the British Joint Computer Conference. IEE Conference publication, vol. 19, pp. 31-37.

    Google Scholar 

  • Wren, Anthony. (1969). “Applications of Computers to Transport Scheduling in the United Kingdom,” West Virginia University Engineering Experiment Station Bulletin91.

  • Wren, Anthony. (1971). Computers in Transport Planning and Operation.London: Ian Allen.

    Google Scholar 

  • Wren, Anthony. (1972). “Bus Scheduling: An Interactive Computer Method,” Transportation Planning and Technology1, 115-122.

    Google Scholar 

  • Wren, Anthony (ed.). (1981a). Computer Scheduling of Public Transport. Amsterdam: North-Holland.

  • Wren, Anthony. (1981b). “General Review of the Use of Computers in Scheduling Buses and Their Crews.” In Anthony Wren (ed.), Computer Scheduling of Public Transport.Amsterdam: North-Holland, pp. 3-17.

  • Wren, Anthony and Alan Holliday. (1972). “Computer Scheduling of Vehicles From One or More Depots to a Number of Delivery Points,” Opl. Res. Q.23, 333-344.

    Google Scholar 

  • Wren, Anthony and Mark Chamberlain. (1988). “The Development of Micro-BUSMAN: Scheduling on Micro-Computers.” In Joachim R. Daduna and Anthony Wren (eds.), Computer-Aided Transit Scheduling. Berlin: Springer-Verlag, pp. 160-174.

    Google Scholar 

  • Wren, Anthony and Barbara M. Smith. (1988). “Experiences With a Crew Scheduling System Based on Set Covering.” In Joachim R. Daduna and Anthony Wren (eds.), Computer-Aided Transit Scheduling.Berlin: Springer-Verlag, pp. 104-118.

    Google Scholar 

  • Wren, Anthony, Raymond S.K. Kwan, and Margaret E. Parker. (1994). “Scheduling of Rail Driver Duties.” In T.K.S. Murthy et al. (eds.), Computers in Railways IV-Volume 2, Railway Operations. Southampton: Computational Mechanics Publications, pp. 81-89.

    Google Scholar 

  • Wren, Anthony and Jean-Marc Rousseau. (1995). “Bus Driver Scheduling: An Overview.” In J.R. Daduna and J. Paixao (eds.), Computer Aided Transit Scheduling-3. Springer-Verlag, pp. 173-187.

  • Wren, Anthony and David O. Wren. (1995). “A Genetic Algorithm for Public Transport Driver Scheduling.” Computers Ops. Res.22, 101-110.

    Google Scholar 

  • Zhao, Liping, Anthony Wren, and Raymond S.K. Kwan. (1995). “Development of a Driver Duty Estimator,” J. Opl. Res. Soc.46, 1102-1110.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Studies, University of Leeds, Leeds, LS2 9JT, UK

    Anthony Wren (Professor of Scheduling and Constraint Management)

Authors
  1. Anthony Wren
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wren, A. Heuristics Ancient and Modern: Transport Scheduling Through the Ages. Journal of Heuristics 4, 87–100 (1998). https://doi.org/10.1023/A:1009694422257

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009694422257

Search

Navigation