S. Muñoz López

Given the station locations of a rapid transit network and the links between them, in this work we tackle the problem of designing the set of lines for the network, minimizing an estimation of the total number of transfers that should be made by the users to arrive at their destinations, so that the number of lines going to each station is as small as possible. It is assumed that whichever two stations are linked by one line at most, and the users choose routes of minimum length for taking their trips. A greedy heuristic procedure for dealing with this problem can be found in the literature. It explicitly determines the shortest routes for those origin-destination pairs of locations whose users are expected to utilize the rapid transit network. We present a 0-1 programming model for solving such problem, and we also report some computational experience on several instances considered in the literature.

Palabras clave: line designing transfer degree of a node

J. Aparicio Baeza, F. Vidal Giménez

M. L. Carpente Rodríguez, A. Cerdeira-Pena, S. Lorenzo Freire

R. Domínguez Gómez, M. J. Lombardía Cortiña, L. Carpente Rodríguez, G. Estévez Pérez, S. Lorenzo Freire

J. García Laguna, V. Pando Fernández, L. A. San José Nieto, J. Sicilia Rodríguez

C. González Martín, A. Sedeño Noda

J. F. Guerrero Razuri

V. López, M. Baez, J. Rodríquez de LLera, D. Sanz, M. Saucedo, P. Torralbo, A. Zapata, J. Tejada, G. Miñana Ropero, A. Borrego, J. Cordero, L. Cruz, M. González, F. Hernández, D. Palomero

I. López Ansorena, A. Camarero Orive, N. González Cancelas, F. Soler Flores

E. Ramos Méndez, J. A. Carrillo Ruiz

G. Ruiz-Garzón, Y. Chalco-Cano, A. Rufián-Lizana, R. Osuna-Gómez

J. Sáez Aguado, P. C. Trandafir

M. I. Sobrón Fernández, N. Martínez Arjona