Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to sol...

Vehicle Routing Problem (VRP) is a popular combinatorial optimization problem which consists in finding an optimal set of routes for a fleet of vehicles in order to serve a specified collection of clients. Capacitated VRP (CVRP) is a version of VRP in which every vehicle has a capacity parameter assigned. The UCT (Upper Confidence bounds applied to Trees) is a heuristic simulation-based algorit...

This paper proposes a new transformation of arc routing problems into equivalents node routing problems, with emphasis on the transformation of Capacitated Arc Routing Problems (CARP) into Capacitated Vehicle Routing Problems (CVRP). For this last case, an analogue transformation has already been proposed in Pearn et al. [21], where each required CARP arc was mapped onto a triplet of CVRP nodes...

The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...

This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is defined as a route on which the vehicle first visits customers in increasing order of custom...

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP is an important problem in the fields of transportation, distribution and logistics. Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...

We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, entire range of tour capacity. The result extends to splittable CVRP.

This paper presents a hybrid approach that aims at solving the Capacitated Vehicle Routing Problem (CVRP) by means of combining Constraint Programming (CP) with Lagrangian Relaxation (LR) and Probabilistic Algorithms. After introducing the CVRP and reviewing the main literature on this area, the paper proposes the use of a multistart hybrid Variable Neighbourhood Search (VNS) algorithm. This al...

This paper describes a new method for solving the Capacitated Vehicle Routing Problem (CVRP). The CVRP is defined as the problem of delivering goods from a depot to a number of customers with a fleet of capacitated vehicles, minimizing the cost of distributing the goods while respecting the capacity constraints of the vehicles. We have developed a method based on Monte Carlo Simulation (MCS) an...