2012
DOI: 10.1002/atr.1195
|View full text |Cite
|
Sign up to set email alerts
|

Design of a tabu search algorithm for assigning optimal bus sizes and frequencies in urban transport services

Abstract: SUMMARY This article presents a bi‐level optimization model to assign optimal bus sizes and frequencies to public transport routes. The upper level problem of the proposed model minimizes a cost function representing the costs of the users and operators, and the lower level solves a public transport assignment model subject to a capacity constraint. The article discusses the benefits of using either Hooke–Jeeves or tabu search algorithms for solving the bi‐level model. Following the real‐case application to th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0
3

Year Published

2014
2014
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(12 citation statements)
references
References 24 publications
0
9
0
3
Order By: Relevance
“…Among these solution approaches, the TS algorithm developed by Glover [32] has been very successful in finding close to optimal solutions for engineering problems [33][34][35][36][37]. The TS algorithm starts searching with an initial solution, based on which a set of feasible solutions is constructed as the neighborhood.…”
Section: Tabu Search Algorithmmentioning
confidence: 99%
“…Among these solution approaches, the TS algorithm developed by Glover [32] has been very successful in finding close to optimal solutions for engineering problems [33][34][35][36][37]. The TS algorithm starts searching with an initial solution, based on which a set of feasible solutions is constructed as the neighborhood.…”
Section: Tabu Search Algorithmmentioning
confidence: 99%
“…Szeto and Wu [30] aimed to improve the existing bus services by reducing the number of transfers and users' total travel time. Ruisanchez and Ibeas [31] presented a bi-level optimization model to assign optimal bus sizes and frequencies to public transport routes. The upper level problem of the proposed model minimizes the cost function representing the costs of the users and operators, and the lower level solves a public transport assignment model subject to capacity constraint.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the TNDP, which is generally formulated as the minimization of the sum of user and operator costs, the optimal transit routes and associated frequencies are sought. On the contrary, there are few studies that deal with the service frequencies for fixed bus route configurations [7,21,22].…”
Section: Introductionmentioning
confidence: 99%
“…In the study, the transit assignment problem was solved based on the procedure presented by Baaj and Mahmassani [11]. Ruisanchez et al [22] developed a bilevel solution method for optimal bus sizes and frequencies in urban transit networks. At the upper level, a cost function representing the costs of users and operators was minimized.…”
Section: Introductionmentioning
confidence: 99%