New Heuristic Techniques for Solving Capacitated Vehicles Routing Problem

Abstract

The vehicle routing problem (VRP) is part from a combinatorial optimization problem (COP) with huge numbers of applications. One of its important applications is Capacitated VRP (CVRP) which is it generalizes the travelling salesman problem (TSP).This research divided into two parts, the first part is the theoretical part; which includes introducing the mathematical formulation of the CVRP and some special cases. While the second part is the practical part.In this partwe introduced new heuristic methods for solving the CVRP. The results of these techniques are compared with exact methods (such as complete enumeration method). Also, they compared with optimal datasets. The comparison results proved the efficiency and speed in CPU-time of the suggested techniques.