An Approach of Optimization in Capacitated Vehicle Routing Problem in Logistics Distribution

The Vehicle Routing Problem (VRP) is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. Usually, VRP is based on a homogeneous fleet size problem which is complex when the vehicle fleet is heterogeneous. In this research, a new hybrid nearest neighbors - tabu search model for homogeneous fleet of vehicle optimization on VRP of logistics distribution is proposed. The proposed hybrid model in routing a homogeneous fleet VRP is tested on a realistic dataset in the Serbian company “Carnex”. The experimental results of this method, in two different scenarios, are compared to the empirical results, demonstrating that the experimental results obtained by the new hybrid nearest neighbors - tabu search model are better than empirical results in the company. Also, experimental results are better for scenario 2, where the starting point for optimization and delivery starts with a customer that has the smallest order.