Advertisement

Driver scheduling based on “driver-friendly” vehicle schedules

  • Viktor Árgilán
  • János Balogh
  • József Békési
  • Balázs Dávid
  • Miklós Krész
  • Attila Tóth
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

In the area of optimization of public transportation there are several methods for modeling and solving vehicle and driver scheduling problems.We designed a sequential heuristic method for solving the combined (vehicle and driver scheduling) problem. Our model is based on a modification of the vehicle schedules to satisfy driver requirements.We introduced a driver friendly approach of the optimization of the scheduling, which is closer to the practice used by public transportation companies.We give test results for this, which are shown as illustrative example for the method in the scheduling of the bus trips of Szeged city, Hungary.

Keywords

Crew Schedule Vehicle Schedule Driver Schedule MILP Solver Vehicle Schedule Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertossi, A.A., Carraresi, P., and Gallo, G.: On Some Matching Problems Arising in VehicleScheduling Models. Networks 17(3), 271–281 (1987)CrossRefGoogle Scholar
  2. 2.
    Bodin, L., Golden, B., Assad, A., and Ball, M.: Routing and Scheduling of Vehicles and Crews: The State of the Art. Computers and Operations Research 10, 63–211 (1983)CrossRefGoogle Scholar
  3. 3.
    Borndörfer, L., Löbel, A., Weider, S.: A Bundle Method for Multi-Depot Integrated Vehicle and Crew Scheduling in Public Transport. Lecture Notes in Economics and Mathematical Systems 600, 3–24 (2008)Google Scholar
  4. 4.
    Dávid, B.: Heuristics for the Multiple-Depot Vehicle Scheduling Problem. In: Proceedings of the MATCOS-10 Conference, accepted for publicationGoogle Scholar
  5. 5.
    Fischetti, M., Lodi, A., Toth, P.: A branch-and-cut algorithm for the multi depot vehicle scheduling problem. Technical report (1999)Google Scholar
  6. 6.
    Fischetti, M., Toth, P.: An additive bounding procedure for combinatorial optimization problems. Operations Research 37(2), 319–328 (1989)CrossRefGoogle Scholar
  7. 7.
    Huisman, D.: Integrated and Dynamic Vehicle and Crew Scheduling. PhD thesis, Erasmus University of Rotterdam (2004)Google Scholar
  8. 8.
    Huisman, D., Freling, R., Wagelmans, A.P.: Multiple-depot integrated vehicle and crew scheduling. Transportation Science 39(4), 491–502 (2005)CrossRefGoogle Scholar
  9. 9.
    Kliewer, N., Mellouli, T., Suhl, L.: A timespace network based exact optimization model for multi-depot bus scheduling. European Journal of Operational Research 175(3), 1616–1627 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Viktor Árgilán
    • 1
  • János Balogh
    • 1
  • József Békési
    • 1
  • Balázs Dávid
    • 1
  • Miklós Krész
    • 1
  • Attila Tóth
    • 1
  1. 1.Juhász Gyula Faculty of Education, Department of Applied InformaticsUniversity of SzegedSzegedHungary

Personalised recommendations