2017
DOI: 10.1007/978-3-319-62428-0_27
|View full text |Cite
|
Sign up to set email alerts
|

Transit Network Frequencies-Setting Problem Solved Using a New Multi-Objective Global-Best Harmony Search Algorithm and Discrete Event Simulation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…MOGBHS is an extension of the Global-Best Harmony Search (GBHS) which provides great results while considering multiple objectives simultaneously. For example, it has provided great results for the generation of schedules for an integrated transit system [32]. MOGBHS showed superior performance relative to NSGA-II.…”
Section: Introductionmentioning
confidence: 99%
“…MOGBHS is an extension of the Global-Best Harmony Search (GBHS) which provides great results while considering multiple objectives simultaneously. For example, it has provided great results for the generation of schedules for an integrated transit system [32]. MOGBHS showed superior performance relative to NSGA-II.…”
Section: Introductionmentioning
confidence: 99%
“…Guihaire and Hao (2008) and Ibarra-Rojas et al (2015) review 26 contributions dealing with headway optimization, showing that early works assume fixed demand and are based on analytic models (Newell 1971;Salzborn 1972;Schéele 1980;Han and Wilson 1982). Six of the 26 works Yu et al 2011;Huang et al 2013;Li et al 2013;Wu et al 2015) and Ruano et al (2017) more recently, employ genetic algorithms for the headway optimization problem. Most of them also use non-linear models, though Li et al (2013) offer a simulation model.…”
Section: Introductionmentioning
confidence: 99%
“…Whilst the last two mentioned works as well as others (Ceder 1984(Ceder , 2001) focus on the optimization of a single line, we are attempting to optimize several intersecting lines (i.e., a whole network) at once (Yu et al 2011). Following the sparse contributions that apply simulation to a problem-specific context (Vázquez-Abad and Zubieta 2005; Mohaymany and Amiripour 2009;Ruano et al 2017), we turn to simulation-based optimization. This approach has proven successful in similar application contexts (Osorio and Bierlaire 2013;Osorio and Chong 2015;Chong and Osorio 2018).…”
Section: Introductionmentioning
confidence: 99%
“…For example, Guihaire and Hao (2008) and Ibarra-Rojas et al (2015) review 26 contributions dealing with headway optimization, showing that early works assume fixed demand and are based on analytic models (Newell 1971;Salzborn 1972;Schéele 1980;Han and Wilson 1982). Six of the 26 works Yu et al 2011;Huang et al 2013;Li et al 2013;Wu et al 2015), as well as Ruano et al (2017) more recently, employ genetic algorithms for the headway optimization problem. Most of them also use non-linear models, though Li et al (2013) offer a simulation model.…”
Section: Introductionmentioning
confidence: 99%
“…Unlike studies that attempt to optimize a single line (e.g., the latter two and Ceder, 1984and Ceder, , 2001, we seek to optimize several lines (i.e., a whole network) at once (Yu et al 2011). Following sparse contributions (Vázquez-Abad and Zubieta 2005;Mohaymany and Amiripour 2009;Ruano et al 2017) that apply simulation to a problemspecific context, we turn to simulation optimization. This approach has proven successful in similar application contexts (Osorio and Bierlaire 2013;Osorio and Chong 2015;Chong and Osorio 2018).…”
Section: Introductionmentioning
confidence: 99%