This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

In this work we investigate two variants of the Stochastic Vehicle Routing Problem: The Vehicle Routing Problem with Stochastic Demands and the Vehicle Routing Problem with Stochastic Demands and Customers. We show that under some moderate conditions there is an asymptotic equivalence between the Vehicle Routing Problem with Stochastic Demands and the Traveling Salesman Problem, as well as betw...

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...