(Created page with " == Abstract == Network-wide maintenance lacks strong theoretical support and practical cases. However, research on this topic has entered an extensive exploratory stage; for...") |
m (Scipediacontent moved page Draft Content 939242037 to 238,295no) |
(No difference)
|
Network-wide maintenance lacks strong theoretical support and practical cases. However, research on this topic has entered an extensive exploratory stage; for example, new network design methods are being sought, and successful practices from traditional maintenance by line and by profession are being incorporated. This paper proposes a novel set-covering model with the variable coverage radius for the maintenance network of urban rail transit systems in the context of network-wide maintenance. The concepts of network-wide maintenance follow principles that are similar to those of bio-geography-based optimization (BBO), i.e., patterns of migration, variation, and extinction of different populations in different habitats. Therefore, a BBO algorithm is implemented with combinatorial optimization programming. Experiments from Changchun city in China show that the proposed model and algorithm are effective in fulfilling network-wide requirements through a direct tradeoff between the coverage radius and maintenance response time. In addition, the maintenance capacity and variable coverage radius of each maintenance point influence both the maintenance timeliness and resource utilization of maintenance units.
Document type: Article
The different versions of the original document can be found in:
Published on 01/01/2020
Volume 2020, 2020
DOI: 10.1155/2020/3971478
Licence: Other
Are you one of the authors of this document?