Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/31312
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A Self-Adjusting Algorithm for Driver Scheduling
Author(s): Li, Jingpeng
Contact Email: jli@cs.stir.ac.uk
Keywords: driver scheduling
combinatorial optimization
fuzzy subset
evolutionary algorithm
Issue Date: Jul-2005
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.
DOI Link: 10.1007/s10732-005-2220-1
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.

Files in This Item:
File Description SizeFormat 
Li2005_Article_ASelf-AdjustingAlgorithmForDri.pdfFulltext - Published Version397.72 kBAdobe PDFUnder Permanent Embargo    Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.



This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.