An Ant Colony Approach to Solve a Vehicle Routing Problem in a FMCG Company
Journal: International Journal of Mechanical and Production Engineering Research and Development (IJMPERD ) (Vol.8, No. 1)Publication Date: 2018-02-28
Authors : Srinivas Rao T; Prakash Marimuthu K;
Page : 1113-1118
Keywords : Consumer Goods; Vehicle Routing Problem & Various Depots;
Abstract
The customers for Fast Moving Consumer Goods [FMCG] are widely spread and often poses challenges for quick delivery of goods. The parameters dealing with the FMCG are logistics cost and time bound delivery of goods. Time slots are the additional constraints which are dealt with this problem. The above problem with the FMCG can be modelled as a Vehicle Routing problem with time slots. In Vehicle routing problems, the vehicle has to cover the entire routes in an optimal manner such that the vehicle visits each and every depot satisfying the customers and also meeting the capacity constraints and customer demands. We have many algorithms to solve the vehicle routing such as GA, Simulated annealing. In this paper, we have adopted ant colony algorithm to find the shortest distance between the various depots.
Other Latest Articles
- REVIEW OF STRENGTHENING TECHNIQUES AND MECHANICAL TESTING FOR UNREINFORCED MASONRY
- Ranking of Lean Tools using Weighted Scoring Method
- Development of a Decision Support System for Solar Panel Selection Using Integrated Analytic Hierarchy Process and Grey Relational Analysis
- FLOWABILITY OF DUSTS FROM DRY OFF-GAS CLEANING: THE INFLUENCE OF PARTICLE SIZE AND THE SPREAD OF THE SIZE DISTRIBUTION
- Current Order and Inventory Models in Manufacturing Environments: A Review from 2008 to 2018
Last modified: 2018-04-26 18:51:55