INVESTIGADORES
MIRANDA BRONT Juan Jose
congresos y reuniones científicas
Título:
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Autor/es:
GONZALO LERA ROMERO; JUAN JOSÉ MIRANDA BRONT
Lugar:
Bologna
Reunión:
Conferencia; Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization; 2018
Institución organizadora:
EURO / ALIO (Universidad de Bologna)
Resumen:
In this paper we study the Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC). We consider two integer programming formulations which exploit the characteristics of the time-dependent travel time function. Two exact algorithms based on these formulations are developed and evaluated on benchmark instances from the literature. Preliminary experiments show that the approach has potential to be used within a Branch and Price algorithm.
