Indexed metadata

Flexible Bus Route Optimization for Multitarget Stations

Sun Ji-yang, Huang Jian-ling, Chen Yan-yan, Wei Pan-yi, Jia Jian-lin

Source record

Source: Crossref

Published: Mar 19, 2020

DOI: 10.1155/2020/7183465

Open original source ↗

Source abstract

This paper proposes a flexible bus route optimization model for efficient public city transportation systems based on multitarget stations. The model considers passenger demands, vehicle capacities, and transportation network and aims to solve the optimal route, minimizing the vehicles’ running time and the passengers’ travel time. A heuristic algorithm based on a gravity model is introduced to solve this NP-hard optimization problem. Simulation studies verify the effectiveness and practicality of the proposed model and algorithm. The results show that the total number of vehicles needed to complete the service is 17–21, the average travel time of each vehicle is 24.59 minutes, the solving time of 100 sets of data is within 25 seconds, and the average calculation time is 12.04 seconds. It can be seen that under the premise of real-time adjustment of connection planning time, the optimization model can satisfy the passenger’s dynamic demand to a greater extent, and effectively reduce the planning path error, shorten the distance and travel time of passengers, and the result is better than that of the flexible bus scheduling model which ignores the change of connection travel time.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.