Evento

Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints

Lera Romero, GonzaloIcon ; Miranda Bront, Juan JoseIcon
Tipo del evento: Reunión
Nombre del evento: Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization
Fecha del evento: 06/2018
Institución Organizadora: Association of European Operational Research Societies; Association of Latin-Iberoamerican Operational Research Societies; International Federation of Operational Research Societies;
Título de la revista: Electronic Notes on Discrete Mathematics
Editorial: Elsevier Science
ISSN: 1571-0653
Idioma: Inglés
Clasificación temática:

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.
Palabras clave: ELEMENTARY SHORTEST PATH , INTEGER PROGRAMMING , TIME-DEPENDENT TRAVEL TIMES
 
Archivos asociados
Thumbnail
 
Tamaño: 249.5Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/137229
URL: https://www.sciencedirect.com/science/article/abs/pii/S1571065318301525
DOI: https://doi.org/10.1016/j.endm.2018.07.008
Colecciones
Eventos(SEDE CENTRAL)
Eventos de SEDE CENTRAL
Citación
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints; Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization; Bologna; Italia; 2018; 53-60
Compartir
Altmétricas