Show simple item record

dc.rights.licenseAtribución-NoComercial 4.0 Internacional
dc.contributor.authorEscobar, John Willmer
dc.contributor.authorLinfati, Rodrigo
dc.contributor.authorAdarme-Jaimes, Wilson
dc.date.accessioned2019-07-02T19:06:39Z
dc.date.available2019-07-02T19:06:39Z
dc.date.issued2015-01-01
dc.identifier.issnISSN: 2346-2183
dc.identifier.urihttps://repositorio.unal.edu.co/handle/unal/60786
dc.description.abstractThis 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.
dc.format.mimetypeapplication/pdf
dc.language.isospa
dc.publisherUniversidad Nacional de Colombia (Sede Medellín). Facultad de Minas.
dc.relationhttps://revistas.unal.edu.co/index.php/dyna/article/view/48552
dc.relation.ispartofUniversidad Nacional de Colombia Revistas electrónicas UN Dyna
dc.relation.ispartofDyna
dc.rightsDerechos reservados - Universidad Nacional de Colombia
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/
dc.subject.ddc62 Ingeniería y operaciones afines / Engineering
dc.titleA hybrid metaheuristic algorithm for the capacitated location routing problem
dc.typeArtículo de revista
dc.type.driverinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dc.identifier.eprintshttp://bdigital.unal.edu.co/59118/
dc.relation.referencesEscobar, 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.accessrightsinfo:eu-repo/semantics/openAccess
dc.subject.proposalLocation Routing Problem (LRP)
dc.subject.proposalIterated Local Search (ILS)
dc.subject.proposalGranular Tabu Search (GTS)
dc.subject.proposalMetaheuristic Algorithms.
dc.type.coarhttp://purl.org/coar/resource_type/c_6501
dc.type.coarversionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.contentText
dc.type.redcolhttp://purl.org/redcol/resource_type/ART
oaire.accessrightshttp://purl.org/coar/access_right/c_abf2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial 4.0 InternacionalThis work is licensed under a Creative Commons Reconocimiento-NoComercial 4.0.This document has been deposited by the author (s) under the following certificate of deposit