Integer programming models and linearizations for the traveling car renter problem

Autores
Goldbarg, Marco C.; Goldbarg, Elizabeth F. G.; Luna, Henrique P. L.; Menezes, Matheus S.; Corrales, Lucas
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The traveling car renter problem (CaRS) is an extension of the classical traveling salesman problem (TSP) where different cars are available for use during the salesman’s tour. In this study we present three integer programming formulations for CaRS, of which two have quadratic objective functions and the other has quadratic constraints. The first model with a quadratic objective function is grounded on the TSP interpreted as a special case of the quadratic assignment problem in which the assignment variables refer to visitation orders. The second model with a quadratic objective function is based on the Gavish and Grave’s formulation for the TSP. The model with quadratic constraints is based on the Dantzig–Fulkerson–Johnson’s formulation for the TSP. The formulations are linearized and implemented in two solvers. An experiment with 50 instances is reported.
Fil: Goldbarg, Marco C.. Universidade Federal do Rio Grande do Norte; Brasil
Fil: Goldbarg, Elizabeth F. G.. Universidade Federal do Rio Grande do Norte; Brasil
Fil: Luna, Henrique P. L.. Universidade Federal de Alagoas; Brasil
Fil: Menezes, Matheus S.. Universidade Federal Rural do Semi-Árido; Brasil
Fil: Corrales, Lucas. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ciencias Exactas. Grupo de Plasmas Densos Magnetizados. Provincia de Buenos Aires. Gobernación. Comision de Investigaciones Científicas. Grupo de Plasmas Densos Magnetizados; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Materia
Combinatorial Optimization
Integer Programming
Traveling Car Renter Problem
Traveling Salesman
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/58945
Acceder
id CONICETDig_59853765a4ff1bfb9f16ac45e70784e9
oai_identifier_str oai:ri.conicet.gov.ar:11336/58945
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Integer programming models and linearizations for the traveling car renter problemGoldbarg, Marco C.Goldbarg, Elizabeth F. G.Luna, Henrique P. L.Menezes, Matheus S.Corrales, LucasCombinatorial OptimizationInteger ProgrammingTraveling Car Renter ProblemTraveling Salesmanhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The traveling car renter problem (CaRS) is an extension of the classical traveling salesman problem (TSP) where different cars are available for use during the salesman’s tour. In this study we present three integer programming formulations for CaRS, of which two have quadratic objective functions and the other has quadratic constraints. The first model with a quadratic objective function is grounded on the TSP interpreted as a special case of the quadratic assignment problem in which the assignment variables refer to visitation orders. The second model with a quadratic objective function is based on the Gavish and Grave’s formulation for the TSP. The model with quadratic constraints is based on the Dantzig–Fulkerson–Johnson’s formulation for the TSP. The formulations are linearized and implemented in two solvers. An experiment with 50 instances is reported.Fil: Goldbarg, Marco C.. Universidade Federal do Rio Grande do Norte; BrasilFil: Goldbarg, Elizabeth F. G.. Universidade Federal do Rio Grande do Norte; BrasilFil: Luna, Henrique P. L.. Universidade Federal de Alagoas; BrasilFil: Menezes, Matheus S.. Universidade Federal Rural do Semi-Árido; BrasilFil: Corrales, Lucas. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ciencias Exactas. Grupo de Plasmas Densos Magnetizados. Provincia de Buenos Aires. Gobernación. Comision de Investigaciones Científicas. Grupo de Plasmas Densos Magnetizados; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaSpringer Heidelberg2018-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/58945Goldbarg, Marco C.; Goldbarg, Elizabeth F. G.; Luna, Henrique P. L.; Menezes, Matheus S.; Corrales, Lucas; Integer programming models and linearizations for the traveling car renter problem; Springer Heidelberg; Optimization Letters; 12; 4; 6-2018; 743-7611862-44721862-4480CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1007/s11590-017-1138-5info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs11590-017-1138-5info: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-03T09:52:27Zoai:ri.conicet.gov.ar:11336/58945instacron: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 09:52:27.409CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Integer programming models and linearizations for the traveling car renter problem
title Integer programming models and linearizations for the traveling car renter problem
spellingShingle Integer programming models and linearizations for the traveling car renter problem
Goldbarg, Marco C.
Combinatorial Optimization
Integer Programming
Traveling Car Renter Problem
Traveling Salesman
title_short Integer programming models and linearizations for the traveling car renter problem
title_full Integer programming models and linearizations for the traveling car renter problem
title_fullStr Integer programming models and linearizations for the traveling car renter problem
title_full_unstemmed Integer programming models and linearizations for the traveling car renter problem
title_sort Integer programming models and linearizations for the traveling car renter problem
dc.creator.none.fl_str_mv Goldbarg, Marco C.
Goldbarg, Elizabeth F. G.
Luna, Henrique P. L.
Menezes, Matheus S.
Corrales, Lucas
author Goldbarg, Marco C.
author_facet Goldbarg, Marco C.
Goldbarg, Elizabeth F. G.
Luna, Henrique P. L.
Menezes, Matheus S.
Corrales, Lucas
author_role author
author2 Goldbarg, Elizabeth F. G.
Luna, Henrique P. L.
Menezes, Matheus S.
Corrales, Lucas
author2_role author
author
author
author
dc.subject.none.fl_str_mv Combinatorial Optimization
Integer Programming
Traveling Car Renter Problem
Traveling Salesman
topic Combinatorial Optimization
Integer Programming
Traveling Car Renter Problem
Traveling Salesman
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The traveling car renter problem (CaRS) is an extension of the classical traveling salesman problem (TSP) where different cars are available for use during the salesman’s tour. In this study we present three integer programming formulations for CaRS, of which two have quadratic objective functions and the other has quadratic constraints. The first model with a quadratic objective function is grounded on the TSP interpreted as a special case of the quadratic assignment problem in which the assignment variables refer to visitation orders. The second model with a quadratic objective function is based on the Gavish and Grave’s formulation for the TSP. The model with quadratic constraints is based on the Dantzig–Fulkerson–Johnson’s formulation for the TSP. The formulations are linearized and implemented in two solvers. An experiment with 50 instances is reported.
Fil: Goldbarg, Marco C.. Universidade Federal do Rio Grande do Norte; Brasil
Fil: Goldbarg, Elizabeth F. G.. Universidade Federal do Rio Grande do Norte; Brasil
Fil: Luna, Henrique P. L.. Universidade Federal de Alagoas; Brasil
Fil: Menezes, Matheus S.. Universidade Federal Rural do Semi-Árido; Brasil
Fil: Corrales, Lucas. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ciencias Exactas. Grupo de Plasmas Densos Magnetizados. Provincia de Buenos Aires. Gobernación. Comision de Investigaciones Científicas. Grupo de Plasmas Densos Magnetizados; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
description The traveling car renter problem (CaRS) is an extension of the classical traveling salesman problem (TSP) where different cars are available for use during the salesman’s tour. In this study we present three integer programming formulations for CaRS, of which two have quadratic objective functions and the other has quadratic constraints. The first model with a quadratic objective function is grounded on the TSP interpreted as a special case of the quadratic assignment problem in which the assignment variables refer to visitation orders. The second model with a quadratic objective function is based on the Gavish and Grave’s formulation for the TSP. The model with quadratic constraints is based on the Dantzig–Fulkerson–Johnson’s formulation for the TSP. The formulations are linearized and implemented in two solvers. An experiment with 50 instances is reported.
publishDate 2018
dc.date.none.fl_str_mv 2018-06
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/58945
Goldbarg, Marco C.; Goldbarg, Elizabeth F. G.; Luna, Henrique P. L.; Menezes, Matheus S.; Corrales, Lucas; Integer programming models and linearizations for the traveling car renter problem; Springer Heidelberg; Optimization Letters; 12; 4; 6-2018; 743-761
1862-4472
1862-4480
CONICET Digital
CONICET
url http://hdl.handle.net/11336/58945
identifier_str_mv Goldbarg, Marco C.; Goldbarg, Elizabeth F. G.; Luna, Henrique P. L.; Menezes, Matheus S.; Corrales, Lucas; Integer programming models and linearizations for the traveling car renter problem; Springer Heidelberg; Optimization Letters; 12; 4; 6-2018; 743-761
1862-4472
1862-4480
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.1007/s11590-017-1138-5
info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs11590-017-1138-5
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.publisher.none.fl_str_mv Springer Heidelberg
publisher.none.fl_str_mv Springer Heidelberg
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_ 1842269159274053632
score 13.13397

Publicaciones similares