Clustering of Maintenance Tasks for the Danish Railway System

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 557)


Standardisation of the European rail traffic signalling system is an ongoing project for faster travel within the EU, which entails very strict time limits and constraints on recovery operations. Denmark will be the first country to upgrade its entire signalling system to implement the new standards. In this paper, we present a mathematical model for allocation of maintenance tasks to maintenance team members, which is a variant of the Generalized Assignment Problem. The aim is to optimise the following three criteria: (i) the total distance travelled from depots to tasks, (ii) the maximal distance between any maintenance task and its allocated crew member, and (iii) the imbalance in workload among crew members. As test cases, we use a set of instances that simulate the distribution of tasks in the Jutland peninsula, the largest region of Denmark.


European Rail Traffic Management System Maintenance scheduling Clustering Mathematical model 


  1. 1.
    Barger, P., Schön, W., Bouali, M.: A study of railway ERTMS safety with Colored Petri Nets. In: Proceedings of the European Safety and Reliability Conference (ESREL 2009), vol. 2, pp. 1303–1309 (2009)Google Scholar
  2. 2.
    Banedanmark., Trafikministeriet.: The signalling programme - a total renewal of the Danish signalling infrastructure, Banedanmark (2009)Google Scholar
  3. 3.
    Zimmermann, A., Hommel, G.: Towards modeling and evaluation of ETCS real-time communication and operation 77(1), 47–54 (2005)Google Scholar
  4. 4.
    Liden, T.: 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. Technical report, Linköping University, Department of Science and Technology (2014).
  5. 5.
    Patra, A.P., Dersin, P., Kumar, U.: Cost effective maintenance policy - a case study. Int. J. Perform. Eng. 6(6), 595–603 (2010)Google Scholar
  6. 6.
    Lenstra, J., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)CrossRefGoogle Scholar
  7. 7.
    Cordeau, J., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8), 928–936 (2001)CrossRefMATHGoogle Scholar
  8. 8.
    Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403–2435 (2007)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jimenez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Ind. Eng. 79, 115–129 (2015)CrossRefGoogle Scholar
  10. 10.
    Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program 62(3), 461–474 (1993)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Giosa, I., Tansini, I., Viera, I.: New assignment algorithms for the multidepot vehicle routing problem. J. Oper. Res. Soc. 52(5), 977–984 (2001)MATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.DTU Management EngineeringTechnical University of DenmarkKongens LyngbyDenmark
  2. 2.School of Electronic Engineering and Computer ScienceQueen Mary University of LondonLondonUK

Personalised recommendations