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

Vista sencilla de ítem
dc.citation.journalTitleUniversidad Pontificia Bolivariana
dc.contributor.authorDuque, Andres Felipe
dc.contributor.authorBaldoquín 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-02-01
dc.description.abstractIntroduction: this work proposes a model, and two heuristic algorithms to assign customers to trucks and visiting days, as a first phase in the solution of a real-world routing problem, which is closely related to the Periodic vehicle routing problemeng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=7971
dc.identifier.doi10.11144/javeriana.iyu22-1.sact.
dc.identifier.issn1201115
dc.identifier.urihttps://hdl.handle.net/10784/27710
dc.language.isospa
dc.relation.urihttp://www.scielo.org.co/scielo.php?script=sci_abstract&pid=S0123-21262018000100053&lng=en&nrm=iso
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0120-1115
dc.sourceUniversidad Pontificia Bolivariana
dc.subject.keywordHeuristicseng
dc.subject.keywordlogisticseng
dc.subject.keywordclusteringeng
dc.subject.keywordallocationeng
dc.subject.keywordperiodic routingeng
dc.titleSolving the assignment of customers to trucks and visiting days in a periodic routing real-world case
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