2020
DOI: 10.1155/2020/6665161
|View full text |Cite
|
Sign up to set email alerts
|

Optimization Scheme of Tradable Credits and Bus Departure Quantity for Travelers’ Travel Mode Choice Guidance

Abstract: To analyze the influence of tradable credits and bus departure quantity on travelers' travel mode choice, this study investigated car travel and bus travel as research objects and established a two-mode day-to-day travel mode choice model based on tradable credits and bus departure quantity. To improve the guiding effect of tradable credits and bus departure quantity, an optimization scheme of tradable credits and bus departure quantity was developed with the goal of minimizing the system total travel time of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 38 publications
(23 reference statements)
0
2
0
Order By: Relevance
“…Model (6)~( 12) is a non-linear mixed integer bilevel programming problem, which is extremely difficult to solve and includes NP-hard optimization problems [30][31][32]; further-more, a particle swarm optimization algorithm can usually be used to solve the problem. The detailed solution steps are as follows:…”
Section: Model Solutionmentioning
confidence: 99%
“…Model (6)~( 12) is a non-linear mixed integer bilevel programming problem, which is extremely difficult to solve and includes NP-hard optimization problems [30][31][32]; further-more, a particle swarm optimization algorithm can usually be used to solve the problem. The detailed solution steps are as follows:…”
Section: Model Solutionmentioning
confidence: 99%
“…Considering the complexity of the solution process for the optimization model of nonlinear mixed-integer bilevel programming problem which includes NP-hard optimization problems (e.g., Karshenas et al [29], Wang et al [30], Zhou et al [31], and Shi et al [32]), we propose a chaotic particle swarm optimization algorithm, which is a parallel algorithm, starts from the random solution, and finds the optimal solution through iteration. e detailed steps are described as follows:…”
Section: Model Solutionmentioning
confidence: 99%