Publicación:
Solving the assignment of customers to trucks and visit days in a periodic routing real-world case1

Vista sencilla de ítem
dc.citation.journalTitleIngenieria y Universidad
dc.contributor.authorDuque Correa A.F.
dc.contributor.authorBaldoquín de la Peña M.G.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupMatemáticas y Aplicacionesspa
dc.date.accessioned2021-04-12T14:04:22Z
dc.date.available2021-04-12T14:04:22Z
dc.date.issued2018-01-01
dc.description.abstractIntroduction: This work proposes a model and two heuristic algorithms to assign customers to trucks and visit days as a first phase in the solution of a real-world routing problem, which is closely related to the PVRP (Periodic Vehicle Routing Problem), but a strategic decision of the company imposes the additional constraint that every customer must always be visited by the same truck. Methods: The proposed model will group the customers that are visited the same day by the same truck as close as possible by means of centroid-based clustering. The first proposed heuristic has a constructive stage and three underlying improvement heuristics, while the second uses an exact linear programming algorithm. Results: The algorithms are evaluated by instances taken from the literature and generated, taking into account the characteristics presented in the real-world case. © 2018, Pontificia Universidad Javeriana. All rights reserved.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=8286
dc.identifier.doi10.11144/Javeriana.iyu22-1.sact
dc.identifier.issn01232126
dc.identifier.issn20112769
dc.identifier.otherSCOPUS;2-s2.0-85054984487
dc.identifier.urihttps://hdl.handle.net/10784/27715
dc.language.isospa
dc.publisherPontificia Universidad Javeriana
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85054984487&doi=10.11144%2fJaveriana.iyu22-1.sact&partnerID=40&md5=12a697d04a1c406a9a807f6632907b90
dc.rightsPontificia Universidad Javeriana
dc.sourceIngenieria y Universidad
dc.subject.keywordAutomobileseng
dc.subject.keywordHeuristic programmingeng
dc.subject.keywordLinear programmingeng
dc.subject.keywordLogisticseng
dc.subject.keywordSaleseng
dc.subject.keywordTruckseng
dc.subject.keywordVehicle routingeng
dc.subject.keywordAllocationeng
dc.subject.keywordClusteringeng
dc.subject.keywordHeuristicseng
dc.subject.keywordLinear programming algorithmeng
dc.subject.keywordPeriodic routingeng
dc.subject.keywordPeriodic vehicle routing problemeng
dc.subject.keywordRouting problemseng
dc.subject.keywordStrategic decisionseng
dc.subject.keywordHeuristic algorithmseng
dc.titleSolving the assignment of customers to trucks and visit days in a periodic routing real-world case1
dc.typeinfo:eu-repo/semantics/article
dc.type.coarversionhttp://purl.org/coar/resource_type/c_6501
dc.type.localArtículospa
dc.type.redcolhttp://purl.org/redcol/resource_type/ARTREF
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dspace.entity.typePublication

Archivos

Colecciones

Artículos