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

Descargar referencia