An estimation of distribution algorithm for public transport driver scheduling

Yindong Shen, Jingpeng Li and Kunkun Peng

International Journal of Operational Research, 2017, vol. 28, issue 2, 245-262

Abstract: Public transport driver scheduling is a process of selecting a set of duties for the drivers of vehicles to form a number of legal driver shifts. The problem usually has two objectives which are minimising both the total number of shifts and the total shift cost, while taking into account some constraints related to labour and company rules. A commonly used approach is firstly to generate a large set of feasible shifts by domain-specific heuristics, and then to select a subset to form the final schedule by an integer programming method. This paper presents an estimation of distribution algorithm (EDA) to deal with the subset selection problem which is NP-hard. To obtain a candidate schedules, the EDA applies a number of rules, with each rule corresponding to a particular way of selecting a shift. Computational results from some real-world instances of drive scheduling demonstrate the availability of this approach.

Keywords: metaheuristics; estimation of distribution algorithm; EDA; Bayesian networks; driver scheduling; public transport; legal driver shifts. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=81483 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:28:y:2017:i:2:p:245-262

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().