Metro track geometry car routing problem with periodic demands: a case study in Beijing, China

Long Chen; Peng Xu; Teng Wang

doi:10.1080/0305215X.2023.2256228

Metro track geometry car routing problem with periodic demands: a case study in Beijing, China

Long Chen, Peng Xu, Teng Wang

Kentucky Transportation Center (KTC)

Research output: Contribution to journal › Article › peer-review

Abstract

Because of their curvature, age, track type and maintenance history, metro tracks should be inspected periodically during the planning horizon. Metro companies operate track geometry cars to periodically collect measurement data from the tracks by crossing the urban rail transit network. Optimizing the schedule for the track geometry car is a challenge: in addition to minimizing travelling distance, the inspection time interval of the same line should be arranged as equally as possible within the planning horizon. This article proposes a mathematical model for the track geometry car routing problem with periodic demands (TGCRP-PD). To effectively address this problem, a memetic algorithm-based metaheuristic is adopted. The proposed solution approach is applied to a real-world case. The numerical results show that the proposed method could save a dead mileage of 295.016 km (accounting for 48.882%) and greatly improve the level of service intervals.

Original language	English
Pages (from-to)	1409-1428
Number of pages	20
Journal	Engineering Optimization
Volume	56
Issue number	9
DOIs	https://doi.org/10.1080/0305215X.2023.2256228
State	Accepted/In press - 2023

Bibliographical note

Publisher Copyright:
© 2023 Informa UK Limited, trading as Taylor & Francis Group.

Funding

This work was supported by the Fundamental Research Funds for the Central Universities [2022YJS063 and 2019JBZ105]. This article was also financially supported by Beijing Subway Co. Ltd through a project. The metro track network and infrastructure inspection schedule data are from Beijing Subway Co. Ltd.

Funders	Funder number
Beijing Subway Co. Ltd
Fundamental Research Funds for the Central Universities	2019JBZ105, 2022YJS063

Keywords

arc routing problem
periodic demands
track geometry car
track inspection
Urban rail transit network

ASJC Scopus subject areas

Computer Science Applications
Control and Optimization
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1080/0305215X.2023.2256228

Cite this

@article{936bc33a471541f9b33eb856820e14f6,

title = "Metro track geometry car routing problem with periodic demands: a case study in Beijing, China",

abstract = "Because of their curvature, age, track type and maintenance history, metro tracks should be inspected periodically during the planning horizon. Metro companies operate track geometry cars to periodically collect measurement data from the tracks by crossing the urban rail transit network. Optimizing the schedule for the track geometry car is a challenge: in addition to minimizing travelling distance, the inspection time interval of the same line should be arranged as equally as possible within the planning horizon. This article proposes a mathematical model for the track geometry car routing problem with periodic demands (TGCRP-PD). To effectively address this problem, a memetic algorithm-based metaheuristic is adopted. The proposed solution approach is applied to a real-world case. The numerical results show that the proposed method could save a dead mileage of 295.016 km (accounting for 48.882%) and greatly improve the level of service intervals.",

keywords = "arc routing problem, periodic demands, track geometry car, track inspection, Urban rail transit network",

author = "Long Chen and Peng Xu and Teng Wang",

note = "Publisher Copyright: {\textcopyright} 2023 Informa UK Limited, trading as Taylor & Francis Group.",

year = "2023",

doi = "10.1080/0305215X.2023.2256228",

language = "English",

volume = "56",

pages = "1409--1428",

number = "9",

}

TY - JOUR

T1 - Metro track geometry car routing problem with periodic demands

T2 - a case study in Beijing, China

AU - Chen, Long

AU - Xu, Peng

AU - Wang, Teng

PY - 2023

Y1 - 2023

N2 - Because of their curvature, age, track type and maintenance history, metro tracks should be inspected periodically during the planning horizon. Metro companies operate track geometry cars to periodically collect measurement data from the tracks by crossing the urban rail transit network. Optimizing the schedule for the track geometry car is a challenge: in addition to minimizing travelling distance, the inspection time interval of the same line should be arranged as equally as possible within the planning horizon. This article proposes a mathematical model for the track geometry car routing problem with periodic demands (TGCRP-PD). To effectively address this problem, a memetic algorithm-based metaheuristic is adopted. The proposed solution approach is applied to a real-world case. The numerical results show that the proposed method could save a dead mileage of 295.016 km (accounting for 48.882%) and greatly improve the level of service intervals.

AB - Because of their curvature, age, track type and maintenance history, metro tracks should be inspected periodically during the planning horizon. Metro companies operate track geometry cars to periodically collect measurement data from the tracks by crossing the urban rail transit network. Optimizing the schedule for the track geometry car is a challenge: in addition to minimizing travelling distance, the inspection time interval of the same line should be arranged as equally as possible within the planning horizon. This article proposes a mathematical model for the track geometry car routing problem with periodic demands (TGCRP-PD). To effectively address this problem, a memetic algorithm-based metaheuristic is adopted. The proposed solution approach is applied to a real-world case. The numerical results show that the proposed method could save a dead mileage of 295.016 km (accounting for 48.882%) and greatly improve the level of service intervals.

KW - arc routing problem

KW - periodic demands

KW - track geometry car

KW - track inspection

KW - Urban rail transit network

UR - http://www.scopus.com/inward/record.url?scp=85173935353&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85173935353&partnerID=8YFLogxK

U2 - 10.1080/0305215X.2023.2256228

DO - 10.1080/0305215X.2023.2256228

M3 - Article

AN - SCOPUS:85173935353

SN - 0305-215X

VL - 56

SP - 1409

EP - 1428

JO - Engineering Optimization

JF - Engineering Optimization

IS - 9

ER -

Metro track geometry car routing problem with periodic demands: a case study in Beijing, China

Abstract

Bibliographical note

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this