An Improved Ant Colony Algorithm for Urban Bus Network Optimization Based on Existing Bus Routes

Abstract

Adding new lines on the basis of the existing public transport network is an important way to improve public transport operation networks and the quality of urban public transport service. Aiming at the problem that existing routes are rarely considered in the previous research on public transportation network planning, a public transportation network optimization method based on an ant colony optimization (ACO) algorithm coupled with the existing routes is proposed. First, the actual road network and existing bus lines were abstracted with a graph data structure, and the integration with origin–destination passenger flow data was completed. Second, according to the ACO algorithm, combined with the existing line structure constraints and ant transfer rules at adjacent nodes, new bus-line planning was realized. Finally, according to the change of direct passenger flow in the entire network, the optimal bus-line network optimization scheme was determined. In the process of node transfer calculation, the algorithm adopts the Softmax strategy to realize path diversity and increase the path search range, while avoiding premature convergence and falling into local optimization. Moreover, the elite ant strategy increases the pheromone release on the current optimal path and accelerates the convergence of the algorithm. Based on existing road network and bus lines, the algorithm carries out new line planning, which increases the rationality and practical feasibility of the new bus-line structure.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 19 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.