A Self-Adjusting Algorithm for Driver Scheduling

Citation

Li J (2005) A Self-Adjusting Algorithm for Driver Scheduling. Journal of Heuristics, 11 (4), pp. 351-367. https://doi.org/10.1007/s10732-005-2220-1

Abstract
Public transport driver scheduling is a world wide problem, which is NP-hard. Although some mathematically based methods are being used in the transport industry, there is still much scope for improvements. This paper presents a novel evolutionary approach that simulates the self-adjusting process on a single schedule. Five factors characterized by fuzzy membership functions are first aggregated to evaluate the shift structure. This evaluating function is incorporated into a constructing heuristic to make shift selection. A self-adjusting algorithm is then designed to guide the constructing heuristic to improve a given initial schedule iteratively. In each generation an unfit portion of the working schedule is removed. Broken schedules are repaired by the constructing heuristic until stopping condition is met. Experimental results on real-world driver scheduling problems has demonstrated the success of the proposed approach.

Keywords
driver scheduling; combinatorial optimization; fuzzy subset; evolutionary algorithm

Journal
Journal of Heuristics: Volume 11, Issue 4