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

Autores
Lera Romero, Gonzalo; Miranda Bront, Juan Jose
Año de publicación
2018
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Fil: Lera Romero, Gonzalo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella. Escuela de Negocios; Argentina
Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization
Bologna
Italia
Association of European Operational Research Societies
Association of Latin-Iberoamerican Operational Research Societies
International Federation of Operational Research Societies
Materia
ELEMENTARY SHORTEST PATH
INTEGER PROGRAMMING
TIME-DEPENDENT TRAVEL TIMES
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/137229
Acceder
id CONICETDig_bb37a5b492e37c853fd759c4f739966a
oai_identifier_str oai:ri.conicet.gov.ar:11336/137229
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Integer programming formulations for the time-dependent elementary shortest path problem with resource constraintsLera Romero, GonzaloMiranda Bront, Juan JoseELEMENTARY SHORTEST PATHINTEGER PROGRAMMINGTIME-DEPENDENT TRAVEL TIMEShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1In 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.Fil: Lera Romero, Gonzalo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella. Escuela de Negocios; ArgentinaJoint EURO/ALIO International Conference 2018 on Applied Combinatorial OptimizationBolognaItaliaAssociation of European Operational Research SocietiesAssociation of Latin-Iberoamerican Operational Research SocietiesInternational Federation of Operational Research SocietiesElsevier Science2018info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectReuniónJournalhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/137229Integer 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-601571-0653CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S1571065318301525info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2018.07.008Internacionalinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:04:21Zoai:ri.conicet.gov.ar:11336/137229instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:04:21.78CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
title Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
spellingShingle Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Lera Romero, Gonzalo
ELEMENTARY SHORTEST PATH
INTEGER PROGRAMMING
TIME-DEPENDENT TRAVEL TIMES
title_short Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
title_full Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
title_fullStr Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
title_full_unstemmed Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
title_sort Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
dc.creator.none.fl_str_mv Lera Romero, Gonzalo
Miranda Bront, Juan Jose
author Lera Romero, Gonzalo
author_facet Lera Romero, Gonzalo
Miranda Bront, Juan Jose
author_role author
author2 Miranda Bront, Juan Jose
author2_role author
dc.subject.none.fl_str_mv ELEMENTARY SHORTEST PATH
INTEGER PROGRAMMING
TIME-DEPENDENT TRAVEL TIMES
topic ELEMENTARY SHORTEST PATH
INTEGER PROGRAMMING
TIME-DEPENDENT TRAVEL TIMES
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Lera Romero, Gonzalo. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Miranda Bront, Juan Jose. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Torcuato Di Tella. Escuela de Negocios; Argentina
Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization
Bologna
Italia
Association of European Operational Research Societies
Association of Latin-Iberoamerican Operational Research Societies
International Federation of Operational Research Societies
description 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.
publishDate 2018
dc.date.none.fl_str_mv 2018
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Reunión
Journal
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
status_str publishedVersion
format conferenceObject
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/137229
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
1571-0653
CONICET Digital
CONICET
url http://hdl.handle.net/11336/137229
identifier_str_mv 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
1571-0653
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S1571065318301525
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2018.07.008
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.coverage.none.fl_str_mv Internacional
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269852731965440
score 13.13397

Publicaciones similares