A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways
针对丹麦铁路新信号系统对故障恢复的严格时间限制，提出一种超启发式框架，将日德兰半岛的维护任务公平分配给分散的维护人员，并最小化同一子区域内任务间的距离。
A new signalling system in Denmark aims at ensuring fast and reliable train operations. However, it imposes very strict time limits on recovery plans in the event of failure. As a result, it is necessary to develop a new approach to the entire maintenance scheduling process. In the largest region of Denmark, the Jutland peninsula, there is a decentralised structure for maintenance planning where the crew start their duties from their home locations rather than starting from a single depot. In this paper, we allocate a set of maintenance tasks in Jutland to a set of maintenance crew members, defining the sub-region that each crew member is responsible for. Two key considerations must be made when allocating tasks to crew members. Firstly a fair balance of workload must exist between crew members. Secondly, the distance between two tasks in the same sub-region must be minimised in order to facilitate a quick response in the case of unexpected failure. We propose a perturbative selection hyper-heuristic framework to improve initial solutions by reassigning outliers (those tasks that are far away) to another crew member at each iteration, using one of five low-level heuristics. The results from two hyper-heuristics, using a number of different initial solution construction methods are presented over a set of 12 benchmark problem instances.