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 () and Attila Tóth ()
Additional contact information
Viktor Árgilán: University of Szeged
János Balogh: University of Szeged
József Békési: University of Szeged
Balázs Dávid: University of Szeged
Miklós Krész: University of Szeged
Attila Tóth: University of Szeged

A chapter in Operations Research Proceedings 2011, 2012, pp 323-328 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-642-29210-1_52

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_52

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().