In capacitated vehicle routing problem (CVRP), a fleet of vehicles with certain capacity starts at central depot and returns to this starting point after serving some customers by using the optimal set routes minimum cost. However, in real-life, environments may include obstacles such as holes, machines, or trees different sizes. research, CVRP extension is proposed that classical one for vario...

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

Abstract The Capacitated Vehicle Routing Problem (CVRP) has been subject to intense research efforts for more than sixty years. Yet, significant algorithmic improvements are still being made. most competitive heuristic solution algorithms of today utilize, and often combine, strategies elements from evolutionary algorithms, local search, ruin-and-recreate based large neighborhood search. In thi...

Transportation and distribution systems are improving with an increasing pace with the help of current technological facilities and additionally, the complexity of those systems are increasing. Vehicle Routing Problems (VRPs) are difficult to solve with conventional techniques. Improving routes used in distribution systems provides significant savings in terms of time and costs. In this paper, ...

This paper introduces the Spaceelling Curve with Optimal Partitioning (SFC OP) heuristic strategy for producing solutions to the Vehicle Routing Problem (VRP). This heuristic has the property that it generates good routes extremely quickly and the time required increases nearly linearly with problem size. Additionally, the SFC OP heuristic can easily be modiied to generate routes to VRP formula...

The mixed vehicle routing problem with backhauls is investigated using ant system heuristic. This distribution problem seems to suffer from a lack of published work even though it has immense practical applicability especially within logistic systems. Some enhancements to the basic ant system algorithm are embedded into the search. In particular a focus is on the choice in the placement of ants...

The Capacitated Vehicle Routing Problem (CVRP) is a well known problem in the optimization literature. In this paper, we consider that there is a single depot (or distribution centre) that caters to the customer demands at a set of sales points (or demand centers) using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to...

In this paper a combination of the two most important problems in distribution logistics is considered, known as the two-dimensional loading vehicle routing problem. This problem combines the loading of the freight into the vehicles, and the successive routing of the vehicles along the road network, with the aim of satisfying the demands of the customers. The problem is solved by different heur...