2017
DOI: 10.7307/ptt.v29i1.2015
|View full text |Cite
|
Sign up to set email alerts
|

Circle Line Optimization of Shuttle Bus in Central Business District without Transit Hub

Abstract: ABSTRACT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 34 publications
0
9
0
Order By: Relevance
“…In the traffic jams, travelers would like to choose public transit which has been proved effective in many literatures. 3,4 These principles are also verified in the early study, such as maximum demand cover and adjacent highquality public transit service. 5 Aros-Vera studied P&R facility's location problems using logit model, where travelers could either select transfer (P&R) facilities or choose a car travel.…”
Section: Literature Reviewmentioning
confidence: 83%
“…In the traffic jams, travelers would like to choose public transit which has been proved effective in many literatures. 3,4 These principles are also verified in the early study, such as maximum demand cover and adjacent highquality public transit service. 5 Aros-Vera studied P&R facility's location problems using logit model, where travelers could either select transfer (P&R) facilities or choose a car travel.…”
Section: Literature Reviewmentioning
confidence: 83%
“…Multi-objective evolutionary algorithms optimize multiple objectives simultaneously and they are widely used in the transportation field. Multi-objective evolutionary algorithms include several such as Non-dominated Sorting Genetic Algorithm (NSGA-II) [24], Multi-Objective Simulated Annealing (MOSA) [25], Multi-Objective Tabu Search Algorithm (MOTS) [26], and Multi-Objective Particle Swarm Optimization (MOPSO) [27]. However, NSGA-II performs better in terms of finding a diverse set of solutions and in converging to near the true pareto-optimal set compared with others.…”
Section: Solution Algorithmmentioning
confidence: 99%
“…The bi-level programming model can be solved by heuristic algorithms, [39][40][41][42][43] the k-nearest neighbors algorithm, 44 the artificial neural network algorithm 45 and so on. In this paper, the SCE-UA is introduced to solve the proposed bilevel programming model.…”
Section: Shuffled Complex Evolution Algorithm For the Distribution Cementioning
confidence: 99%