2020
DOI: 10.1109/access.2020.2974740
|View full text |Cite
|
Sign up to set email alerts
|

Mixed Scheduling Strategy for High Frequency Bus Routes With Common Stops

Abstract: Bus routes overlapping would lead to more than one bus entering the stop simultaneously, which may trigger bus bunching. Focusing on high frequency routes with common stops, this paper proposes a mixed scheduling method combining the all-stop service and the stop-skipping service. The method optimizes scheduling strategies for multiple routes by minimizing total passenger travel time. The optimization variables are binary variables reflecting whether the stops in the overlapping area are skipped. Three excitin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 44 publications
0
2
0
Order By: Relevance
“…Huang et al [18] established a two-stage framework and optimized the bus route by establishing three nonlinear programming models. Bie et al [19] proposed a mixed scheduling method combining the all-stop service and the stop-skipping service, the method optimizes scheduling strategies for multiple routes by minimizing total passenger travel time. Han et al [20] presented a detailed flow chart of a CB network planning methodology, including individual reservation travel demand data processing, CB line origin destination (OD) area division considering quantity constraints of demand in areas and distance constraints based on agglomerative hierarchical clustering.…”
Section: A Cb Transitmentioning
confidence: 99%
See 1 more Smart Citation
“…Huang et al [18] established a two-stage framework and optimized the bus route by establishing three nonlinear programming models. Bie et al [19] proposed a mixed scheduling method combining the all-stop service and the stop-skipping service, the method optimizes scheduling strategies for multiple routes by minimizing total passenger travel time. Han et al [20] presented a detailed flow chart of a CB network planning methodology, including individual reservation travel demand data processing, CB line origin destination (OD) area division considering quantity constraints of demand in areas and distance constraints based on agglomerative hierarchical clustering.…”
Section: A Cb Transitmentioning
confidence: 99%
“…If it is 0, it means that the Q value of all the "stateactions" experienced by state t s has been updated; if it is not 0, continue to index the previous sequence " The Q value of "state-action" is updated until all Q values are updated, so that the Q values of n states are updated without repeated training n times. The update formula is shown in equation (19), where 1, 2,..., 2,1…”
Section: E Algorithm Improvementmentioning
confidence: 99%