Facets and valid inequalities for the time-dependent travelling salesman problem

Autores
Miranda Bront, Juan Jose; Méndez-Díaz, Isabel; Zabala, Paula Lorena
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider two formulations proposed in the literature, we analyze the relationship between them and derive several families of valid inequalities and facets. In addition to their theoretical properties, they prove to be very effective in the context of a Branch and Cut algorithm.
Fil: Miranda Bront, Juan Jose. 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: Méndez-Díaz, Isabel. 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: Zabala, Paula Lorena. 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
Materia
Combinatorial Optimization
Integer Programming
Time-Dependent Tsp
Branch And Cut
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/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/31995
Acceder
id CONICETDig_11d84fb104f4827ca06ea06c62e92d0a
oai_identifier_str oai:ri.conicet.gov.ar:11336/31995
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Facets and valid inequalities for the time-dependent travelling salesman problemMiranda Bront, Juan JoseMéndez-Díaz, IsabelZabala, Paula LorenaCombinatorial OptimizationInteger ProgrammingTime-Dependent TspBranch And Cuthttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider two formulations proposed in the literature, we analyze the relationship between them and derive several families of valid inequalities and facets. In addition to their theoretical properties, they prove to be very effective in the context of a Branch and Cut algorithm.Fil: Miranda Bront, Juan Jose. 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: Méndez-Díaz, Isabel. 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: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaElsevier Science2013-05info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/31995Zabala, Paula Lorena; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Facets and valid inequalities for the time-dependent travelling salesman problem; Elsevier Science; European Journal of Operational Research; 236; 3; 5-2013; 891-9020377-2217CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2013.05.022info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0377221713004219info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-10T12:59:54Zoai:ri.conicet.gov.ar:11336/31995instacron: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-10 12:59:54.73CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Facets and valid inequalities for the time-dependent travelling salesman problem
title Facets and valid inequalities for the time-dependent travelling salesman problem
spellingShingle Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda Bront, Juan Jose
Combinatorial Optimization
Integer Programming
Time-Dependent Tsp
Branch And Cut
title_short Facets and valid inequalities for the time-dependent travelling salesman problem
title_full Facets and valid inequalities for the time-dependent travelling salesman problem
title_fullStr Facets and valid inequalities for the time-dependent travelling salesman problem
title_full_unstemmed Facets and valid inequalities for the time-dependent travelling salesman problem
title_sort Facets and valid inequalities for the time-dependent travelling salesman problem
dc.creator.none.fl_str_mv Miranda Bront, Juan Jose
Méndez-Díaz, Isabel
Zabala, Paula Lorena
author Miranda Bront, Juan Jose
author_facet Miranda Bront, Juan Jose
Méndez-Díaz, Isabel
Zabala, Paula Lorena
author_role author
author2 Méndez-Díaz, Isabel
Zabala, Paula Lorena
author2_role author
author
dc.subject.none.fl_str_mv Combinatorial Optimization
Integer Programming
Time-Dependent Tsp
Branch And Cut
topic Combinatorial Optimization
Integer Programming
Time-Dependent Tsp
Branch And Cut
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider two formulations proposed in the literature, we analyze the relationship between them and derive several families of valid inequalities and facets. In addition to their theoretical properties, they prove to be very effective in the context of a Branch and Cut algorithm.
Fil: Miranda Bront, Juan Jose. 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: Méndez-Díaz, Isabel. 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: Zabala, Paula Lorena. 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
description The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider two formulations proposed in the literature, we analyze the relationship between them and derive several families of valid inequalities and facets. In addition to their theoretical properties, they prove to be very effective in the context of a Branch and Cut algorithm.
publishDate 2013
dc.date.none.fl_str_mv 2013-05
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/31995
Zabala, Paula Lorena; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Facets and valid inequalities for the time-dependent travelling salesman problem; Elsevier Science; European Journal of Operational Research; 236; 3; 5-2013; 891-902
0377-2217
CONICET Digital
CONICET
url http://hdl.handle.net/11336/31995
identifier_str_mv Zabala, Paula Lorena; Méndez-Díaz, Isabel; Miranda Bront, Juan Jose; Facets and valid inequalities for the time-dependent travelling salesman problem; Elsevier Science; European Journal of Operational Research; 236; 3; 5-2013; 891-902
0377-2217
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2013.05.022
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0377221713004219
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
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_ 1842979845631377408
score 12.48226

Publicaciones similares