An Ant Colony and Simulated Annealing Algorithm with Excess Load VRP in a FMCG Company

Abstract

Fast moving consumer goods pose a major research problem as the objective is to reach the customers in an efficient manner. The delivery of goods to consumers must reach quickly without any hurdles. We assume that the FMCG companies have multiple number of warehouse hubs to reach its vast majority of consumers. Sometimes a single vehicle may not be enough to complete the tour, hence we may require another small vehicle to reach the small set of customers. The above problem has been modelled as a supply chain vehicle routing model. In our paper we have used ant colony and simulated annealing algorithm to discuss the above problem and compare their efficiencies.