DC FieldValueLanguage
dc.contributor.authorĐorić, Danijelaen
dc.contributor.authorEl Cadi, Abdessamad Aiten
dc.contributor.authorHanafi, Saïden
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorArtiba, Abdelhakimen
dc.date.accessioned2020-05-02T16:41:56Z-
dc.date.available2020-05-02T16:41:56Z-
dc.date.issued2017-04-01en
dc.identifier.issn1571-0653-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2409-
dc.description.abstractMaintenance 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.en
dc.publisherElsevier-
dc.relation.ispartofElectronic Notes in Discrete Mathematicsen
dc.subjectMaintenance | minimum sum of squares | optimization | railway infrastructure | variable neighborhood searchen
dc.titleClustering approach in maintenance of capillary railway networken
dc.typeArticleen
dc.identifier.doi10.1016/j.endm.2017.03.031en
dc.identifier.scopus2-s2.0-85017413576en
dc.relation.firstpage239en
dc.relation.lastpage246en
dc.relation.volume58en
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

3
checked on Jun 11, 2024

Page view(s)

76
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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