Optimisation of Customer Demand for Multi-Depot Dynamic Vehicle Routing Problem using Stochastic Demand and Variant of Ant Algorithm

Abstract

This paper deals with the key issue of management to improve the allocation capability, facilitating the optimization of the objective in minimizing the cost, with the accuracy in dynamic allocation of nearest customers to depot. A method has been proposed to solve the Multi Depot Vehicle Routing Problem (MDVRP) based on Ant Algorithm which is a modified version of the traditional Ant colony Optimization (ACO).Depending on the stochastic demand, distance between depot to customer and customer to customer, the solution to MDVRP is calculated with variant of Ant Algorithm.