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 the city of Santander (Spain), it is concluded that both algorithms lead to very similar solutions. It has also been shown that when both algorithms start from the same homogenous solution, the convergence speed of tabu search is almost 50% quicker than that of Hooke–Jeeves, making tabu search more attractive if there is a need to solve a problem many times and for large networks. Copyright © 2012 John Wiley & Sons, Ltd.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 18 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.