A hybrid metaheuristic algorithm for the capacitated location routing problem

This paper addresses the Capacitated Location-Routing Problem (CLRP) in which the aim is to determine the depots to be opened, the customers to be assigned to each open depot, and the routes to be performed to fulfill the demand of the customers. The objective is to minimize the sum of the cost of t...

Full description

Autores:
Escobar, John Willmer
Linfati, Rodrigo
Adarme-Jaimes, Wilson
Tipo de recurso:
Article of journal
Fecha de publicación:
2015
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/60786
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/60786
http://bdigital.unal.edu.co/59118/
Palabra clave:
62 Ingeniería y operaciones afines / Engineering
Location Routing Problem (LRP)
Iterated Local Search (ILS)
Granular Tabu Search (GTS)
Metaheuristic Algorithms.
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional
id UNACIONAL2_610c14acd5230cac0e7ecd6d687a44e8
oai_identifier_str oai:repositorio.unal.edu.co:unal/60786
network_acronym_str UNACIONAL2
network_name_str Universidad Nacional de Colombia
repository_id_str
spelling Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Escobar, John Willmer9afac0bc-81b4-44a3-946c-a25501faa9cc300Linfati, Rodrigoab749dd6-5297-44a6-af56-34f9a3613e84300Adarme-Jaimes, Wilsonfb2a81a0-bc5a-4ecf-934a-185f26e696fc3002019-07-02T19:06:39Z2019-07-02T19:06:39Z2015-01-01ISSN: 2346-2183https://repositorio.unal.edu.co/handle/unal/60786http://bdigital.unal.edu.co/59118/This paper addresses the Capacitated Location-Routing Problem (CLRP) in which the aim is to determine the depots to be opened, the customers to be assigned to each open depot, and the routes to be performed to fulfill the demand of the customers. The objective is to minimize the sum of the cost of the open depots, of the used vehicle costs, and of the variable costs associated with the distance traveled by the performed routes. In this paper, a Granular Tabu Search (GTS) with different diversification strategies within a Iterated Local Search (ILS) is proposed to solve the CLRP. A shaking procedure is applied whenever the best solution found so far is not improved for a given number of iterations. Computational experiments on benchmark instances taken from the literature show that the proposed approach is able to obtain, within short computing times, high quality solutions illustrating its effectiveness.application/pdfspaUniversidad Nacional de Colombia (Sede Medellín). Facultad de Minas.https://revistas.unal.edu.co/index.php/dyna/article/view/48552Universidad Nacional de Colombia Revistas electrónicas UN DynaDynaEscobar, John Willmer and Linfati, Rodrigo and Adarme-Jaimes, Wilson (2015) A hybrid metaheuristic algorithm for the capacitated location routing problem. DYNA, 82 (189). pp. 243-251. ISSN 2346-218362 Ingeniería y operaciones afines / EngineeringLocation Routing Problem (LRP)Iterated Local Search (ILS)Granular Tabu Search (GTS)Metaheuristic Algorithms.A hybrid metaheuristic algorithm for the capacitated location routing problemArtículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/ARTORIGINAL48552-240969-1-PB.pdfapplication/pdf610109https://repositorio.unal.edu.co/bitstream/unal/60786/1/48552-240969-1-PB.pdff0a15bf25606e25ea135f4619d8fa823MD51THUMBNAIL48552-240969-1-PB.pdf.jpg48552-240969-1-PB.pdf.jpgGenerated Thumbnailimage/jpeg9318https://repositorio.unal.edu.co/bitstream/unal/60786/2/48552-240969-1-PB.pdf.jpgae154a65a2caf8cb77855eb3e066cd0cMD52unal/60786oai:repositorio.unal.edu.co:unal/607862024-04-15 23:08:45.712Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co
dc.title.spa.fl_str_mv A hybrid metaheuristic algorithm for the capacitated location routing problem
title A hybrid metaheuristic algorithm for the capacitated location routing problem
spellingShingle A hybrid metaheuristic algorithm for the capacitated location routing problem
62 Ingeniería y operaciones afines / Engineering
Location Routing Problem (LRP)
Iterated Local Search (ILS)
Granular Tabu Search (GTS)
Metaheuristic Algorithms.
title_short A hybrid metaheuristic algorithm for the capacitated location routing problem
title_full A hybrid metaheuristic algorithm for the capacitated location routing problem
title_fullStr A hybrid metaheuristic algorithm for the capacitated location routing problem
title_full_unstemmed A hybrid metaheuristic algorithm for the capacitated location routing problem
title_sort A hybrid metaheuristic algorithm for the capacitated location routing problem
dc.creator.fl_str_mv Escobar, John Willmer
Linfati, Rodrigo
Adarme-Jaimes, Wilson
dc.contributor.author.spa.fl_str_mv Escobar, John Willmer
Linfati, Rodrigo
Adarme-Jaimes, Wilson
dc.subject.ddc.spa.fl_str_mv 62 Ingeniería y operaciones afines / Engineering
topic 62 Ingeniería y operaciones afines / Engineering
Location Routing Problem (LRP)
Iterated Local Search (ILS)
Granular Tabu Search (GTS)
Metaheuristic Algorithms.
dc.subject.proposal.spa.fl_str_mv Location Routing Problem (LRP)
Iterated Local Search (ILS)
Granular Tabu Search (GTS)
Metaheuristic Algorithms.
description This paper addresses the Capacitated Location-Routing Problem (CLRP) in which the aim is to determine the depots to be opened, the customers to be assigned to each open depot, and the routes to be performed to fulfill the demand of the customers. The objective is to minimize the sum of the cost of the open depots, of the used vehicle costs, and of the variable costs associated with the distance traveled by the performed routes. In this paper, a Granular Tabu Search (GTS) with different diversification strategies within a Iterated Local Search (ILS) is proposed to solve the CLRP. A shaking procedure is applied whenever the best solution found so far is not improved for a given number of iterations. Computational experiments on benchmark instances taken from the literature show that the proposed approach is able to obtain, within short computing times, high quality solutions illustrating its effectiveness.
publishDate 2015
dc.date.issued.spa.fl_str_mv 2015-01-01
dc.date.accessioned.spa.fl_str_mv 2019-07-02T19:06:39Z
dc.date.available.spa.fl_str_mv 2019-07-02T19:06:39Z
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.spa.fl_str_mv info:eu-repo/semantics/article
dc.type.version.spa.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.coar.spa.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.coarversion.spa.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.content.spa.fl_str_mv Text
dc.type.redcol.spa.fl_str_mv http://purl.org/redcol/resource_type/ART
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.issn.spa.fl_str_mv ISSN: 2346-2183
dc.identifier.uri.none.fl_str_mv https://repositorio.unal.edu.co/handle/unal/60786
dc.identifier.eprints.spa.fl_str_mv http://bdigital.unal.edu.co/59118/
identifier_str_mv ISSN: 2346-2183
url https://repositorio.unal.edu.co/handle/unal/60786
http://bdigital.unal.edu.co/59118/
dc.language.iso.spa.fl_str_mv spa
language spa
dc.relation.spa.fl_str_mv https://revistas.unal.edu.co/index.php/dyna/article/view/48552
dc.relation.ispartof.spa.fl_str_mv Universidad Nacional de Colombia Revistas electrónicas UN Dyna
Dyna
dc.relation.references.spa.fl_str_mv Escobar, John Willmer and Linfati, Rodrigo and Adarme-Jaimes, Wilson (2015) A hybrid metaheuristic algorithm for the capacitated location routing problem. DYNA, 82 (189). pp. 243-251. ISSN 2346-2183
dc.rights.spa.fl_str_mv Derechos reservados - Universidad Nacional de Colombia
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.rights.license.spa.fl_str_mv Atribución-NoComercial 4.0 Internacional
dc.rights.uri.spa.fl_str_mv http://creativecommons.org/licenses/by-nc/4.0/
dc.rights.accessrights.spa.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución-NoComercial 4.0 Internacional
Derechos reservados - Universidad Nacional de Colombia
http://creativecommons.org/licenses/by-nc/4.0/
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.mimetype.spa.fl_str_mv application/pdf
dc.publisher.spa.fl_str_mv Universidad Nacional de Colombia (Sede Medellín). Facultad de Minas.
institution Universidad Nacional de Colombia
bitstream.url.fl_str_mv https://repositorio.unal.edu.co/bitstream/unal/60786/1/48552-240969-1-PB.pdf
https://repositorio.unal.edu.co/bitstream/unal/60786/2/48552-240969-1-PB.pdf.jpg
bitstream.checksum.fl_str_mv f0a15bf25606e25ea135f4619d8fa823
ae154a65a2caf8cb77855eb3e066cd0c
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositorio Institucional Universidad Nacional de Colombia
repository.mail.fl_str_mv repositorio_nal@unal.edu.co
_version_ 1814089803222745088