Solving the assignment of customers to trucks and visiting days in a periodic routing real-world case
| dc.citation.journalTitle | Universidad Pontificia Bolivariana | |
| dc.contributor.author | Duque, Andres Felipe | |
| dc.contributor.author | Baldoquín M.G. | |
| dc.contributor.department | Universidad EAFIT. Departamento de Ciencias | spa |
| dc.contributor.researchgroup | Matemáticas y Aplicaciones | spa |
| dc.creator | Duque, Andres Felipe | |
| dc.creator | Baldoquín M.G. | |
| dc.date.accessioned | 2021-04-12T14:04:22Z | |
| dc.date.available | 2021-04-12T14:04:22Z | |
| dc.date.issued | 2018-02-01 | |
| dc.description.abstract | Introduction: 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 problem | eng |
| dc.identifier | https://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=7971 | |
| dc.identifier.doi | 10.11144/javeriana.iyu22-1.sact. | |
| dc.identifier.issn | 01201115 | |
| dc.identifier.uri | http://hdl.handle.net/10784/27710 | |
| dc.language.iso | spa | eng |
| dc.relation.uri | http://www.scielo.org.co/scielo.php?script=sci_abstract&pid=S0123-21262018000100053&lng=en&nrm=iso | |
| dc.rights | https://v2.sherpa.ac.uk/id/publication/issn/0120-1115 | |
| dc.source | Universidad Pontificia Bolivariana | |
| dc.subject | Heuristics | eng |
| dc.subject | logistics | eng |
| dc.subject | clustering | eng |
| dc.subject | allocation | eng |
| dc.subject | periodic routing | eng |
| dc.title | Solving the assignment of customers to trucks and visiting days in a periodic routing real-world case | eng |
| dc.type | article | eng |
| dc.type | info:eu-repo/semantics/article | eng |
| dc.type | info:eu-repo/semantics/publishedVersion | eng |
| dc.type | publishedVersion | eng |
| dc.type.local | Artículo | spa |