2015
DOI: 10.1061/(asce)te.1943-5436.0000741
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Modification of Urban Bus Network Routes Using a Genetic Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0
8

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(19 citation statements)
references
References 34 publications
0
10
0
8
Order By: Relevance
“…In addition, hybrid DE-PSO achieves lower average T wt and T tr as compared with hybrid PSO-DE. Furthermore, both algorithms produced solutions in which the (9) set current particle � 1 st particle in swarm (10) select a particle randomly (except the selected 1 st particle) in the swarm (11) apply particle modification scheme to generate a modified particle (repair if infeasible) (12) fitness evaluation using passenger assignment on the modified particle (13) if modified particle is better than personal best (14) update personal best and its fitness (15) else if modified particle is better than global best (16) update global best and its fitness (17) end if (18) end for (19) (1) Generate N p candidate route set using construction heuristic with iSRR repair mechanism (2) for i ≔ 1 to N p (3) fitness evaluation using passenger assignment model (4) end for (5) for n ≔ 1 to G (6) for i ≔ 1 to N p (7) set Target vector � X i,n (8) select randomly a vector (except the selected Target vector, X i,n ) in the population (9) apply identical point mutation to generate a Noisy Random vector, V i,n (repair if infeasible) (10) apply uniform route crossover between X i,n and V i,n to generate a pair of Trial vectors, U i,n (repair if infeasible) (11) fitness evaluation of U i,n using passenger assignment model (12) elitism selection (13) if Trial vector fitness ≤ Target vector fitness (14) new_population Table 6.…”
Section: Comparison Of Hybrid De-pso and Hybrid Pso-dementioning
confidence: 99%
See 1 more Smart Citation
“…In addition, hybrid DE-PSO achieves lower average T wt and T tr as compared with hybrid PSO-DE. Furthermore, both algorithms produced solutions in which the (9) set current particle � 1 st particle in swarm (10) select a particle randomly (except the selected 1 st particle) in the swarm (11) apply particle modification scheme to generate a modified particle (repair if infeasible) (12) fitness evaluation using passenger assignment on the modified particle (13) if modified particle is better than personal best (14) update personal best and its fitness (15) else if modified particle is better than global best (16) update global best and its fitness (17) end if (18) end for (19) (1) Generate N p candidate route set using construction heuristic with iSRR repair mechanism (2) for i ≔ 1 to N p (3) fitness evaluation using passenger assignment model (4) end for (5) for n ≔ 1 to G (6) for i ≔ 1 to N p (7) set Target vector � X i,n (8) select randomly a vector (except the selected Target vector, X i,n ) in the population (9) apply identical point mutation to generate a Noisy Random vector, V i,n (repair if infeasible) (10) apply uniform route crossover between X i,n and V i,n to generate a pair of Trial vectors, U i,n (repair if infeasible) (11) fitness evaluation of U i,n using passenger assignment model (12) elitism selection (13) if Trial vector fitness ≤ Target vector fitness (14) new_population Table 6.…”
Section: Comparison Of Hybrid De-pso and Hybrid Pso-dementioning
confidence: 99%
“…In particular, Ngamchai and Lovell [10] and Fan and Machemehl [11] utilized a GA on theoretical networks, while Arbex and da Cunha [12] experimented on Mandl's Swiss network. Furthermore, Gundaliya et al [13] and Tom and Mohan [14] studied medium-size network in Chennai, India, while Amiripour et al [15] studied a network in Iran. More recently, Owais and Osman [16] experimented a GA on a transportation network in Rivera City, Northern Uruguay.…”
Section: Introductionmentioning
confidence: 99%
“…It is possible to do this using PRIVOL as well, but not in the exactly optimal manner. Moreover, it is not certain that, comparing with [16], such a high percentage of the existing lines remains intact. Using PRIVOL in this case requires sensitive changes of the initial "candidate" set of routes L 0 .…”
Section: Cost Minimization In the Case Of One System With A Homogeneomentioning
confidence: 99%
“…GA is widely used to find optimal solutions by examining only a small fraction of the possible candidates (Senouci & Al-Derham, 2008). It can also be used as a filter to screen out unwanted paths in order to find the optimal/ near-optimal solution (Mahdi Amiripour, Mohaymany, & Ceder, 2014). Other evolution-inspired techniques, such as swarm intelligence, ant colony optimization, particle swarm optimization, hill-climbing, bee algorithm-simulated annealing, and tabu search, are considered as effective alternatives to exact algorithms for solving complex optimization problems.…”
Section: Literature Reviewmentioning
confidence: 99%