2013
DOI: 10.1016/j.eswa.2013.05.002
|View full text |Cite
|
Sign up to set email alerts
|

Transit network design by Bee Colony Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
108
0
4

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 153 publications
(122 citation statements)
references
References 43 publications
1
108
0
4
Order By: Relevance
“…Moreover, the authors also implemented an alternative algorithm that increases the population size after each iteration. The later study present a comparison between the proposed algorithms and the ones by Baaj and Mahmassani (1991), Chakroborty and Dwivedi (2002), Fan and Machemehl (2008), Nikolić and Teodorović (2013). Numerical results show that the GA with elitism outperforms the other approaches compared in the study in all three criteria in most of the tested instances.…”
Section: Metaheuristic Algorithms For the Transit Network Designmentioning
confidence: 86%
See 2 more Smart Citations
“…Moreover, the authors also implemented an alternative algorithm that increases the population size after each iteration. The later study present a comparison between the proposed algorithms and the ones by Baaj and Mahmassani (1991), Chakroborty and Dwivedi (2002), Fan and Machemehl (2008), Nikolić and Teodorović (2013). Numerical results show that the GA with elitism outperforms the other approaches compared in the study in all three criteria in most of the tested instances.…”
Section: Metaheuristic Algorithms For the Transit Network Designmentioning
confidence: 86%
“…Improvements are obtained also for the average travel time. Later, Nikolić and Teodorović (2014) extend their previous approach outlined by Nikolić and Teodorović (2013) considering elastic demand and the minimization of the weighted sum of the total number of unsatisfied passengers, the total travel time of all passengers, and the fleet size. Nayeem et al (2014) develop two versions of a GA with elitism to solve the TND with static demand which minimizes the weighted sum of unsatisfied passengers, the total number of transfers, and the total travel time of all served passengers.…”
Section: Metaheuristic Algorithms For the Transit Network Designmentioning
confidence: 97%
See 1 more Smart Citation
“…Greedy based methods use a node as start node, then they begin to construct route by connecting a node adjacent to the considered node. This process is repeated, until the route construction is completed, as shown in Fig 3. The next node to visit is selected according to a strategy [35][36][37].…”
Section: Fig 2: the General Framework Of The Tndpmentioning
confidence: 99%
“…Transit deserts are defined as areas where the transit demand is significantly greater than the supply. Compared to previous transit planning methods based on complicated network modeling (Schöbel, 2011;Nayeem et al, 2014;Nikolić and Teodorović, 2013), this research presents a straightforward GIS method to quickly measure the transit demand and supply at the city block group level and professionally presents the results.…”
Section: Introductionmentioning
confidence: 99%