Authors: Amin Ahmadi; Ahmad Foroozantabar
In this paper we want by use of ant Colony Optimization (ACO) that is one of the meta-heuristic methods that constructs solutions of hard combinatorial optimization problems. In this desertion, a suitable algorithm is presented to minimize logistic costs in supply chain downstream and in distribution network’s chain. Suggested algorithm is based on Ant Colony System and searched two goals with finding paths with the minimum number of vehicles and minimum time of costumers, service. This algorithm has been implemented on a distribution network company producing dairy products with 75 clients. Initially vehicle routing problem of this company has been solved with used nearest neighborhood heuristic algorithm And its result is compared with the proposed algorithm. The results show that the response of proposed algorithm is more efficient from the response of nearest neighborhood algorithm. The proposed algorithm is fully applicable and it has this capability that is implemented on the supply chain network in our country and thereby to achieve reducing supply chain logistic cost and ultimately reducing product’s final price.
colony optimization, Vehicle routing, Cyclic transfer, combinatorial optimization, Optimization.
Download Full Paper