A Performance Analysis for Minimum Spanning Tree Based Genetic Algorithm Approach to Design and Optimize Distribution Network Problem

Turan Paksoy, Hasan Kursat Gules

Abstract


Supply chain management encompasses a complex business relations network that contains synchronized inter and intra organizational efforts to optimizing forward flow of materials and reverse flow of knowledge through the overall production and distribution system from raw material suppliers to the last customers. Thus, one of the vital issues in supply chain management is design and optimization of a large network consisting of various business entities such as suppliers, manufacturers, distribution centers and customers. In the literature, this design problem is generally defined as non polynomial-hard (NP-hard) and genetic algorithm approach is one of the popular solution methods for the problem.From this point of view, in this study, performance analysis for minimum spanning tree based genetic algorithm approach to a design and optimization of distribution networks problem (which is a combination of multiple-choice Knapsack problem with the capacitated location-allocation problem) in supply chain management is made and optimum combination of genetic operators is searched as an extension of Syarif et al. (2002).

Keywords


Supply Chain Management; Design and Optimization of Distribution Networks; Genetic Algorithms; Minimum Spanning Tree Based Approach; Performance Analysis.

Full Text:

Untitled