A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem

Vista sencilla de ítem
dc.contributor.authorPosada A.
dc.contributor.authorRivera J.C.
dc.contributor.authorPalacio J.D.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupMatemáticas y Aplicacionesspa
dc.creatorPosada A.
dc.creatorRivera J.C.
dc.creatorPalacio J.D.
dc.date.accessioned2021-04-12T13:55:40Z
dc.date.available2021-04-12T13:55:40Z
dc.date.issued2018-01-01
dc.description.abstractIn this paper, we propose a new vehicle routing problem variant. The new problem is a type of selective vehicle routing model in which it is not necessary to visit all nodes, but to visit enough nodes in such a way that all clusters are visited and from which it is possible to cover all nodes. Here, a mixed-integer linear programming formulation (MILP) is proposed in order to model the problem. The MILP is tested by using adapted instances from the generalized vehicle routing problem (GVRP). The model is also tested on small size GVRP instances as a special case of our proposed model. The results allow to evaluate the impact of clusters configuration in solver efficacy. © 2018, Springer Nature Switzerland AG.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=8284
dc.identifier.doi10.1007/978-3-030-00353-1_10
dc.identifier.issn18650929
dc.identifier.issn18650937
dc.identifier.otherSCOPUS;2-s2.0-85053995044
dc.identifier.urihttp://hdl.handle.net/10784/27669
dc.language.isoengeng
dc.publisherSpringer Verlag
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85053995044&doi=10.1007%2f978-3-030-00353-1_10&partnerID=40&md5=894b624e08c68d36f9ab5f09d1e65a18
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/1865-0929
dc.sourceCommunications in Computer and Information Science
dc.subject.keywordCombinatorial optimizationeng
dc.subject.keywordVehicle routingeng
dc.subject.keywordVehicleseng
dc.subject.keywordGeneralized vehicle routing problemseng
dc.subject.keywordMixed integer linear programmingeng
dc.subject.keywordMixed integer linear programming modeleng
dc.subject.keywordVehicle Routing Problemseng
dc.subject.keywordInteger programmingeng
dc.titleA Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problemeng
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos

Colecciones

Documentos de conferencia