2020
DOI: 10.3390/smartcities3020029
|View full text |Cite
|
Sign up to set email alerts
|

A Particle Swarm Optimization Algorithm for the Solution of the Transit Network Design Problem

Abstract: The research presented in this paper proposes a Particle Swarm Optimization (PSO) approach for solving the transit network design problem in large urban areas. The solving procedure is divided in two main phases: in the first step, a heuristic route generation algorithm provides a preliminary set of feasible and comparable routes, according to three different design criteria; in the second step, the optimal network configuration is found by applying a PSO-based procedure. This study presents a comparison betwe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 37 publications
(34 reference statements)
0
6
0
1
Order By: Relevance
“…In terms of solving algorithms, metaheuristic algorithms are widely applied concerning that the transit network design problems are considered to be NP-hard given the nonconvex solution space [21]. Commonly used algorithms are genetic algorithms, artifcial bee colony algorithms, particle swarm optimization algorithms, and hybrid methods [27][28][29]. Metaheuristic algorithms combine the advantages of random search and neighborhood search and are characterized by fast convergence and wide application.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In terms of solving algorithms, metaheuristic algorithms are widely applied concerning that the transit network design problems are considered to be NP-hard given the nonconvex solution space [21]. Commonly used algorithms are genetic algorithms, artifcial bee colony algorithms, particle swarm optimization algorithms, and hybrid methods [27][28][29]. Metaheuristic algorithms combine the advantages of random search and neighborhood search and are characterized by fast convergence and wide application.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In essence, the core idea of particle swarm optimization is that the particles in the swarm complete the decision under the combined action of the information of themselves and their peers [4].…”
Section: Principle Of Particle Swarm Optimizationmentioning
confidence: 99%
“…Moreover, many researchers claimed that PSO is a viable method and its computational efficiency is better than GA and DE [14][15][16][17]. Also, there is a cluster of studies that used PSO in solving the BRT route optimization problem and the Transportation Network Design Problems (TNDP) in high-density urban areas [18][19][20][21]. Many studies focused on the bus stations' spacing in urban areas.…”
Section: Generating the New Population And Go Up For Evaluatingmentioning
confidence: 99%