Original scientific paper

https://doi.org/10.17559/TV-20151231153445

Chinese postman problem approach for a large-scale conventional rail network in Turkey

Mustafa Yılmaz ; Faculty of Industrial Engineering, University of Atatürk, 25070 Erzurum, Turkey
Merve Kayacı Çodur orcid.org/0000-0003-1459-9678 ; Faculty of Industrial Engineering, University of Atatürk, 25070 Erzurum, Turkey
Hamid Yılmaz orcid.org/0000-0003-0852-4119 ; Bayburt University, Industrial Engineering Department, Dede Korkut Kampüsü, 69000 Bayburt, Turkey

Abstract

Every year, railways are inspected periodically to examine the status of rail tracks and ensure the safety of train operations of the railroad networks in Turkey. These inspection projects must be performed by several specialized machines with large and expensive equipment. Finding the optimum route of inspection machines that control through travelling all lines is critically important in terms of cost and distance. In current practice, determining the route of these machines is largerly manual and primarily relies on the knowledge and judgment of experts. This paper proposes Chinese Postman Problem (CPP) to solve the inspection machine routing problem. The objective is to minimize the total travel distance on the railroads by finding the shortest route. The proposed model is applied to a large-scale real world problem. Compared to the current practice the proposed approach significantly outperforms the reduced objective value by 20,76%.

Keywords

arc routing; Chinese postman problem; railway inspection

Hrčak ID:

188244

URI

https://hrcak.srce.hr/188244

Publication date:

25.10.2017.

Article data in other languages: croatian

Visits: 3.874 *