CVRPCapacitated Vehicle Routing Problem (programming)
CVRPClean Vehicle Rebate Project (California)
CVRPCertified Vacation Rental Professional (credential)
CVRPCombat Veterans for Ron Paul
CVRPCentral Visayas Regional Project (World Bank project; Philippines)
CVRPCentre de Vacances Robert Perez (French: Robert Perez Holiday Center)
CVRPCoyote Valley Research Park (California)
CVRPCommunication/Computer Vulnerability Program
Copyright 1988-2018, All rights reserved.
References in periodicals archive ?
For this study, we considered the Capacitated Vehicle Routing Problem (CVRP) for route reoptimization.
[44], solving the CVRP. These works are described in the following section.
El VRPH es un problema NP-hard debido a que es una generalizacion del problema de ruteo de vehiculos con restricciones de capacidad (CVRP), donde los vehiculos pueden tener capacidades y costos diferentes.
For the experimentation, four different problems have been used: the traveling salesman problem (TSP), the capacitated vehicle routing problem (CVRP) [40], the N-queens problem (NQP), and the one-dimensional bin packing problem (BPP) [41].
(3) The CVRP(r) can be solved by using any efficient CVRP methodology, for example, the classic Clarke and Wright heuristic [26] which isused in our experiments because the heuristic is able to generate a very good solution in short time and is thus suitable for large-scale simulation.