Discussion on computational complexity of railway network design problems
In this talk we discuss on the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. The objective is the maximization of the number of travelers using the new network to be built. We study the impact of two factors: the constraints that the new network should satisfy (budget constraint and no-cycle constraint), and the topology of the underlying network (a general network, and a forest). Five out of the six problems analyzed are NP-hard, whereas the sixth is trivial. Due to the complex nature of these problems, we propose a genetic algorithm, which is tested over a set of randomly generated instances.
Palabras clave / Keywords: transportation networks/graphs computational complexity
Otros trabajos en la misma sesión
Últimas noticias
-
04/06/18
Certificados -
13/04/18
Resumen del programa y Programa detallado -
22/03/18
Descuentos en medios de trasporte para congresistas y acompañantes -
01/02/18
Ampliación del plazo de tarifa superreducida -
19/01/18
Ampliación de plazos -
15/01/18
Programación para el día 29 de mayo -
15/01/18
Conferenciantes plenarios -
12/01/18
Sede: Palacio de Congresos -
24/12/17
Sesión plenaria en memoria del Profesor Pedro Gil -
24/12/17
Corrección bases del Premio Ramiro Melendreras