Estamos realizando la búsqueda. Por favor, espere...

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

Abstract: This article presents a bi-level optimization model to assign optimal bus sizes and frequencies to publictransport routes. The upper level problem of the proposed model minimizes a cost function representingthe costs of the users and operators, and the lower level solves a public transport assignment model subjectto a capacity constraint. The article discusses the bene?ts of using either Hooke?Jeeves or tabu searchalgorithms for solving the bi-level model. Following the real-case application to the city of Santander(Spain), it is conclude d that both algorithms lead to very similar solutions. It has also been shown that whenboth algorithms start from the same homogenous solution, the convergence speed of tabu search is almost50% quicker than that of Hooke?Jeeves, making tabu search more attractive if there is a need to solve aproblem many times and for large networks.

 Autoría: Ruisanchez F., Dell'Olio L., Ibeas A.,

 Congreso: EURO Working Group on Transportation (13th : 2009 : Padua)

 Editorial: Institute for Transportation

 Año de publicación: 2012

 Nº de páginas: 11

 Tipo de publicación: Comunicación a Congreso

 DOI: 10.1002/atr.1195

 ISSN: 0197-6729,2042-3195

 Proyecto español: TRA2006-14663 ; PT-2006-027-06IAPP ; INTERCOR

 Url de la publicación: https://doi.org/10.1002/atr.1195