Bi-objective bus scheduling optimization with passenger perception in mind

© 2023. The Author(s)..

With the development of big traffic data, bus schedules should be changed from the traditional "empirical" rough scheduling to "responsive" accurate scheduling to meet the travel needs of passengers. Based on passenger flow distribution, considering passengers' feelings of congestion and waiting time at the station, we establish a Dual-Cost Bus Scheduling Optimization Model (Dual-CBSOM) with the optimization objectives of minimizing bus operation and passenger travel costs. Improving the classical Genetic Algorithm (GA) by adaptively determining the crossover probability and mutation probability of the algorithm. We use an Adaptive Double Probability Genetic Algorithm (A_DPGA) to solve the Dual-CBSOM. Taking Qingdao city as an example for optimization, the constructed A_DPGA is compared with the classical GA and Adaptive Genetic Algorithm (AGA). By solving the arithmetic example, we get the optimal solution that can reduce the overall objective function value by 2.3%, improve the bus operation cost by 4.0%, and reduce the passenger travel cost by 6.3%. The conclusions show that the Dual_CBSOM built can better meet the passenger travel demand, improve passenger travel satisfaction, and reduce the passenger travel cost and waiting for cost. It is demonstrated that the A_DPGA built in this research has faster convergence and better optimization results.

Medienart:

E-Artikel

Erscheinungsjahr:

2023

Erschienen:

2023

Enthalten in:

Zur Gesamtaufnahme - volume:13

Enthalten in:

Scientific reports - 13(2023), 1 vom: 13. Apr., Seite 6102

Sprache:

Englisch

Beteiligte Personen:

Liu, Shuai [VerfasserIn]
Liu, Lin [VerfasserIn]
Pei, Dongmei [VerfasserIn]
Wang, Jue [VerfasserIn]

Links:

Volltext

Themen:

Journal Article

Anmerkungen:

Date Completed 14.04.2023

Date Revised 16.04.2023

published: Electronic

Citation Status PubMed-not-MEDLINE

doi:

10.1038/s41598-023-32997-4

funding:

Förderinstitution / Projekttitel:

PPN (Katalog-ID):

NLM355597837