Estimating of time-dependent travel times vía Mixed Integer Programming

Autores
Zunino, Juan José; Miranda Bront, Juan José
Año de publicación
2024
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Routing and distribution problems have been widely studied within the Operations Research (OR) community. When restricting to distribution problems in large cities, the congestion of the road network becomes a key aspect with a significant practical impact. These problems are known as Time-Dependent VRPs (TDVRPs), as they naturally capture the effect of congestion by assuming that the travel time between any two customers varies depending on the departure time. The TDVRP literature has widely accepted to model the time-dependent travel time model between two customers as continuous piecewise linear (PWL) function that satisfies the first-in first-out (FIFO) condition. In this paper, we investigate the problem of estimating these continuous PWL travel time functions from real data travel time data. We benchmark two recently proposed Mixed Integer Programming based models for estimating general PWL functions and a well-known heuristic proposed within the context of travel-time estimations. In addition, we also contribute with a new dataset of instances created using real-world data as input.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
travel time estimation
piecewise linear functions
mixed integer programming
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/177364
Acceder
id SEDICI_f3421fcf71b610d85262f898ed9cbf61
oai_identifier_str oai:sedici.unlp.edu.ar:10915/177364
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Estimating of time-dependent travel times vía Mixed Integer ProgrammingZunino, Juan JoséMiranda Bront, Juan JoséCiencias Informáticastravel time estimationpiecewise linear functionsmixed integer programmingRouting and distribution problems have been widely studied within the Operations Research (OR) community. When restricting to distribution problems in large cities, the congestion of the road network becomes a key aspect with a significant practical impact. These problems are known as Time-Dependent VRPs (TDVRPs), as they naturally capture the effect of congestion by assuming that the travel time between any two customers varies depending on the departure time. The TDVRP literature has widely accepted to model the time-dependent travel time model between two customers as continuous piecewise linear (PWL) function that satisfies the first-in first-out (FIFO) condition. In this paper, we investigate the problem of estimating these continuous PWL travel time functions from real data travel time data. We benchmark two recently proposed Mixed Integer Programming based models for estimating general PWL functions and a well-known heuristic proposed within the context of travel-time estimations. In addition, we also contribute with a new dataset of instances created using real-world data as input.Sociedad Argentina de Informática e Investigación Operativa2024-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf411-413http://sedici.unlp.edu.ar/handle/10915/177364enginfo:eu-repo/semantics/altIdentifier/url/https://revistas.unlp.edu.ar/JAIIO/article/view/18010info:eu-repo/semantics/altIdentifier/issn/2451-7496info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:19:36Zoai:sedici.unlp.edu.ar:10915/177364Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:19:37.108SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Estimating of time-dependent travel times vía Mixed Integer Programming
title Estimating of time-dependent travel times vía Mixed Integer Programming
spellingShingle Estimating of time-dependent travel times vía Mixed Integer Programming
Zunino, Juan José
Ciencias Informáticas
travel time estimation
piecewise linear functions
mixed integer programming
title_short Estimating of time-dependent travel times vía Mixed Integer Programming
title_full Estimating of time-dependent travel times vía Mixed Integer Programming
title_fullStr Estimating of time-dependent travel times vía Mixed Integer Programming
title_full_unstemmed Estimating of time-dependent travel times vía Mixed Integer Programming
title_sort Estimating of time-dependent travel times vía Mixed Integer Programming
dc.creator.none.fl_str_mv Zunino, Juan José
Miranda Bront, Juan José
author Zunino, Juan José
author_facet Zunino, Juan José
Miranda Bront, Juan José
author_role author
author2 Miranda Bront, Juan José
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
travel time estimation
piecewise linear functions
mixed integer programming
topic Ciencias Informáticas
travel time estimation
piecewise linear functions
mixed integer programming
dc.description.none.fl_txt_mv Routing and distribution problems have been widely studied within the Operations Research (OR) community. When restricting to distribution problems in large cities, the congestion of the road network becomes a key aspect with a significant practical impact. These problems are known as Time-Dependent VRPs (TDVRPs), as they naturally capture the effect of congestion by assuming that the travel time between any two customers varies depending on the departure time. The TDVRP literature has widely accepted to model the time-dependent travel time model between two customers as continuous piecewise linear (PWL) function that satisfies the first-in first-out (FIFO) condition. In this paper, we investigate the problem of estimating these continuous PWL travel time functions from real data travel time data. We benchmark two recently proposed Mixed Integer Programming based models for estimating general PWL functions and a well-known heuristic proposed within the context of travel-time estimations. In addition, we also contribute with a new dataset of instances created using real-world data as input.
Sociedad Argentina de Informática e Investigación Operativa
description Routing and distribution problems have been widely studied within the Operations Research (OR) community. When restricting to distribution problems in large cities, the congestion of the road network becomes a key aspect with a significant practical impact. These problems are known as Time-Dependent VRPs (TDVRPs), as they naturally capture the effect of congestion by assuming that the travel time between any two customers varies depending on the departure time. The TDVRP literature has widely accepted to model the time-dependent travel time model between two customers as continuous piecewise linear (PWL) function that satisfies the first-in first-out (FIFO) condition. In this paper, we investigate the problem of estimating these continuous PWL travel time functions from real data travel time data. We benchmark two recently proposed Mixed Integer Programming based models for estimating general PWL functions and a well-known heuristic proposed within the context of travel-time estimations. In addition, we also contribute with a new dataset of instances created using real-world data as input.
publishDate 2024
dc.date.none.fl_str_mv 2024-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/177364
url http://sedici.unlp.edu.ar/handle/10915/177364
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://revistas.unlp.edu.ar/JAIIO/article/view/18010
info:eu-repo/semantics/altIdentifier/issn/2451-7496
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
411-413
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260702553702400
score 13.13397

Publicaciones similares