A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways

Abstract 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.

[1]  Libertad Tansini,et al.  Comparing assignment algorithms for the Multi-Depot VRP , 2001 .

[2]  Anand Rajaraman,et al.  Mining of Massive Datasets , 2011 .

[3]  Eric Soubeiga,et al.  Development and application of hyperheuristics to personnel scheduling , 2003 .

[4]  Fred Glover,et al.  Extensions of the Petal Method for Vehicle Routeing , 1993 .

[5]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[6]  I D Giosa,et al.  New assignment algorithms for the multi-depot vehicle routing problem , 2002, J. Oper. Res. Soc..

[7]  Carlos Castro,et al.  Stable solving of CVRPs using hyperheuristics , 2009, GECCO '09.

[8]  Tomas Lidén Survey of railway maintenance activities from a planning perspective and literature review concerning the use of mathematical algorithms for solving such planning and scheduling problems , 2014 .

[9]  Khaled Mesghouni,et al.  Colored Petri Net Model for Discrete System Communication Management on the European Rail Traffic Management System (ERTMS) Level 2 , 2014, 2014 UKSim-AMSS 16th International Conference on Computer Modelling and Simulation.

[10]  Gian Mauricio Fritsche,et al.  A Hyper-Heuristic for the Multi-Objective Integration and Test Order Problem , 2015, GECCO.

[11]  Graham Kendall,et al.  Scheduling English Football Fixtures over the Holiday Period Using Hyper-heuristics , 2010, PPSN.

[12]  Edmund K. Burke,et al.  Modified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem , 2014, ICGEC.

[13]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[14]  Jairo R. Montoya-Torres,et al.  A literature review on the vehicle routing problem with multiple , 2014 .

[15]  Mikael Rönnqvist,et al.  Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..

[16]  A. Sima Etaner-Uyar,et al.  Selection hyper-heuristics in dynamic environments , 2013, J. Oper. Res. Soc..

[17]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[18]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[19]  Uday Kumar,et al.  Cost effective maintenance policy : a case study , 2010 .

[20]  Graham Kendall,et al.  Choice function based hyper-heuristics for multi-objective optimization , 2015, Appl. Soft Comput..

[21]  Fan Peng,et al.  Scheduling of track inspection and maintenance activities in railroad networks , 2011 .

[22]  R Tapsall Application of ERTMS to the diverse Australian network , 2003 .

[23]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[24]  Hugo Terashima-Marín,et al.  A hyper-heuristic for solving one and two-dimensional bin packing problems , 2011, GECCO '11.

[25]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[26]  Edmund K. Burke,et al.  A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling , 2010, Int. J. Appl. Metaheuristic Comput..

[27]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[28]  Pavol Barger,et al.  A study of railway ERTMS safety with Colored Petri Nets , 2009 .

[29]  P. Cowling,et al.  A Parameter-Free Hyperheuristic for Scheduling a Sales Summit , 2002 .