Solving the Allocation of Customers to Potential Distribution Centers in Supply Chain Networks by GA, KA, SA

This paper studies on the two main parties of supply chain network; distribution centers (DCs) and costumers. The allocation problem of these parties is one of the main issues in the supply chain. There are two core types of cost for this problem; opening cost, assumed for opening a potential DC plus dispatching cost per unit from DC to the costumers. The model chooses some potential places as distribution centers to supply requirements of all costumers. In order to solve such NP-hard and basic problem, three algorithms are used. The Taguchi experimental design method utilized to find the best parameters for each algorithm. The aim of efficiency evaluation of proposed algorithms is several test problems which are employed and are compared to the computational results of each algorithm. Eventually, we examine the impacts of the rise in the problem size on the performance of our algorithms

کلیدواژه ها:

Allocation Problem ، Supply Chain ، Metaheuristic Algorithms