Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/115750
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Aeronautical and Aviation Engineering | en_US |
| dc.creator | Zhou, B | en_US |
| dc.creator | Zeng, W | en_US |
| dc.creator | Liu, W | en_US |
| dc.creator | Yang, H | en_US |
| dc.date.accessioned | 2025-10-27T08:17:08Z | - |
| dc.date.available | 2025-10-27T08:17:08Z | - |
| dc.identifier.uri | http://hdl.handle.net/10397/115750 | - |
| dc.language.iso | en | en_US |
| dc.subject | Benders decomposition | en_US |
| dc.subject | Branch-and-price | en_US |
| dc.subject | Inspection timetable | en_US |
| dc.subject | Synchronized optimization | en_US |
| dc.subject | UAV | en_US |
| dc.subject | Working schedule | en_US |
| dc.title | Scheduling UAV-assisted urban subway inspection services | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 199 | en_US |
| dc.identifier.doi | 10.1016/j.trb.2025.103287 | en_US |
| dcterms.abstract | The periodic inspection and maintenance of subway facilities are essential for ensuring system and passenger safety. However, the current manual inspection practices conducted by expert engineers are time-consuming, costly, and pose risks to workers. Unmanned aerial vehicles (UAVs) offer a promising solution for automatically inspecting subway facilities. This paper investigates an operational-level synchronized optimization problem, aiming to determine an optimal inspection timetable while simultaneously optimizing working schedules for both human teams and UAVs. Demand heterogeneity is taken into account since the variety of facilities and equipment in subway tunnels may have different required inspection cycles. By constructing “feasible and optimal task combination” sets, an Integer Linear Programming (ILP) model is formulated to address this NP-hard problem. We apply Dantzig–Wolfe decomposition to obtain a set-covering reformulation and develop an exact solution algorithm integrating Benders decomposition within a branch-and-price framework to solve the model efficiently. The approach is strengthened by implementing several tailored acceleration strategies. Extensive numerical experiments have been carried out. The results show that our proposed optimization model and algorithms can find the optimal or near-optimal solution for real-world scale instances, resulting in cost savings and improved efficiency. Furthermore, we highlight the benefits of integrated optimization by comparing our solution approach with a sequential method that addresses inspection timetables and working schedules separately. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Transportation research. Part B, Methodological, Sept. 2025, v. 199, 103287 | en_US |
| dcterms.isPartOf | Transportation research. Part B, Methodological | en_US |
| dcterms.issued | 2025-09 | - |
| dc.identifier.scopus | 2-s2.0-105012377142 | - |
| dc.identifier.artn | 103287 | en_US |
| dc.description.validate | 202510 bchy | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G000288/2025-08 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | The authors would like to thank the referees for their useful comments, which helped improve both the technical quality and exposition of this paper substantially. This research project (Project Number: S2024.A7.022.24S) is funded by the Strategic Public Policy Research Funding Scheme of The Government of the Hong Kong Special Administrative Region . This study is also partially supported by the Research Grants Council of Hong Kong through NSFC/RGC Joint Research Scheme ( N_PolyU521/22 ), and The Hong Kong Polytechnic University ( P0040900 , P0041316 ). | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2027-09-30 | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



