2021-04-122018-01-011865092918650937SCOPUS;2-s2.0-85053995044http://hdl.handle.net/10784/27669In 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.enghttps://v2.sherpa.ac.uk/id/publication/issn/1865-0929info:eu-repo/semantics/conferencePaperCombinatorial optimizationVehicle routingVehiclesGeneralized vehicle routing problemsMixed integer linear programmingMixed integer linear programming modelVehicle Routing ProblemsInteger programming2021-04-12Posada A.Rivera J.C.Palacio J.D.10.1007/978-3-030-00353-1_10