Open AccessTransit Route Planning for Megacities Based on Demand Density of Complex Networks
Author(s) -
Pang Ming-bao,
Xing Wang,
Li-xia Ma
Publication year - 2022
Publication title -
promet
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.315
H-Index - 19
eISSN - 1848-4069
pISSN - 0353-5320
DOI - 10.7307/ptt.v34i1.3752
Subject(s) - megacity , public transport , node (physics) , computer science , transport engineering , work (physics) , mand , computer network , engineering , mechanical engineering , psychology , developmental psychology , economy , structural engineering , autism , economics
The aim of this work is to investigate the simplifica-tion of public transport networks (PTNs) for megacities and the optimisation of route planning based on the de-mand density of complex networks. A node deletion rule for network centre areas and a node merging rule for net-work border areas in the PTN are designed using the de-mand density of complex networks. A transit route plan-ning (TRP) model is established, which considers the demands of direct passengers, transfer passengers at the same stop and transfer passengers at different stops, and aims at maximising the transit demand density of a PTN. An optimisation process for TRP is developed based on the ant colony optimisation (ACO). The proposed method was validated through a sample application in Handan City in China. The results indicate that urban PTNs can be simplified while retaining their local attributes to a great extent. The hierarchical structure of the network is more obvious, and the layer-by-layer planning of routes can be effectively used in TRP. Moreover, the operating efficiency and service level of urban PTNs can be en-hanced effectively.