Authors: Đorić, Danijela
El Cadi, Abdessamad Ait
Hanafi, Saïd
Mladenović, Nenad 
Artiba, Abdelhakim
Title: Clustering approach in maintenance of capillary railway network
Journal: Electronic Notes in Discrete Mathematics
Volume: 58
First page: 239
Last page: 246
Issue Date: 1-Apr-2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.03.031
Maintenance optimization of railway infrastructure includes several kinds of aspects, such as safety, economic, operational, organization and regulatory issues. Among them the regulatory issues, that are fixed, increase the maintenance costs significantly. This is especially true in so-called capillary networks (local regional railway networks), where only the freight transport exists. Hence, the question is how to minimize maintenance costs with respect to regulatory issues? To solve this problem, we propose a clustering approach. The idea is to cluster tracks, considering elements of railway infrastructure as attributes. Once railway tracks are clustered in groups with similar attributes, then the maintenance can be organized more efficiently. In this paper, Variable Neighborhood Search metaheuristic is developed to solve minimum sum of squares clustering problem. Based on the results of clustering and available real and simulated data we report 22% savings in maintenance schedule for clusters.
Keywords: Maintenance | minimum sum of squares | optimization | railway infrastructure | variable neighborhood search
Publisher: Elsevier

Show full item record


checked on May 29, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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