Clustering approach in maintenance of capillary railway network

DOI10.1016/j.endm.2017.03.031zbMath1384.90013OpenAlexW2607444721MaRDI QIDQ1687690

Saïd Hanafi, Nenad Mladenović, Abdessamad Ait El Cadi, Abdelhakim Artiba, Danijela Đorić

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.031

zbMATH Keywords

optimizationvariable neighborhood searchmaintenanceminimum sum of squaresrailway infrastructure

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• J-MEANS

Cites Work

• Unnamed Item
• Variable neighbourhood search: methods and applications
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search
• Modeling and solving the periodic maintenance problem
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: Clustering approach in maintenance of capillary railway network