The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches

In this paper, two stages of supply chain network; distribution centers (DCs) and customers, are considered. There are customers with particular demands and potential places which are candidate to be as distribution centers. Each of the potential DCs can ship to any of the customers. Two types of costs are considered; opening cost, assumed for opening a potential DC plus shipping cost per unit from DC to the customers. The proposed model selects some potential places as distribution centers in order to supply demands of all customers. In order to solve the given problem, two algorithms, genetic algorithm and artificial immune algorithm, are developed. The Taguchi experimental design method is applied to select the optimum parameters with the least possible number of experiments. For the purpose of performance evaluation of proposed algorithms, various problem sizes are utilized and the computational results of the algorithms are compared with each other. Finally, we investigate the impacts of the rise in the problem size on the performance of our algorithms.

[1]  Raid Al-Aomar,et al.  A GA-based parameter design for single machine turning process with high-volume production , 2006, Comput. Ind. Eng..

[2]  F. Jabbarizadeh,et al.  Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints , 2009, Comput. Ind. Eng..

[3]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[4]  Reza Tavakkoli-Moghaddam,et al.  A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness , 2007, Inf. Sci..

[5]  Zbigniew Michalewicz,et al.  A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem , 1991, INFORMS J. Comput..

[6]  Kai Yang,et al.  Design for Six Sigma : A Roadmap for Product Development , 2003 .

[7]  Zhi-Hua Hu,et al.  A multiobjective immune algorithm based on a multiple-affinity model , 2010, Eur. J. Oper. Res..

[8]  Ruud H. Teunter,et al.  A strategic capacity allocation model for a complex supply chain: formulation and solution approach comparison , 2009 .

[9]  Dipankar Dasgupta,et al.  Guest editorial special issue on artificial immune systems , 2002, IEEE Trans. Evol. Comput..

[10]  Mitsuo Gen,et al.  The balanced allocation of customers to multiple distribution centers in the supply chain network: a genetic algorithm approach , 2002 .

[11]  F. Burnet.  The clonal selection theory of acquired immunity , 1959 .

[12]  G L Ada,et al.  The clonal-selection theory. , 1987, Scientific American.

[13]  Mitsuo Gen,et al.  Spanning tree-based genetic algorithm for bicriteria transportation problem , 1998 .

[14]  M. Gen,et al.  Improved Genetic Algorithm for Solving Multiobjective Solid Transportation Problem with Fuzzy Numbers , 1997 .

[15]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[16]  S. Kim,et al.  Optimization of manufacturing parameters for a brake lining using Taguchi method , 2003 .

[17]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[18]  Jonathan Timmis,et al.  Artificial immune systems as a novel soft computing paradigm , 2003, Soft Comput..

[19]  Cb Bernhard Tilanus.  Introduction to information systems in logistics and transportation , 1997 .

[20]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[21]  Tung-Kuan Liu,et al.  Improved immune algorithm for global numerical optimization and job-shop scheduling problems , 2007, Appl. Math. Comput..

[22]  Jonathan Timmis,et al.  Special issue on artificial immune systems , 2010, Swarm Intelligence.

[23]  M. Gen,et al.  A note on genetic algorithms for degree‐constrained spanning tree problems , 1997 .

[24]  Jonathan Timmis,et al.  Artificial immune systems - a new computational intelligence paradigm , 2002 .

[25]  Jerne Nk.  Towards a network theory of the immune system. , 1974 .

[26]  Mitsuo Gen,et al.  Genetic Algorithms and Manufacturing Systems Design , 1996 .

[27]  Mitsuo Gen,et al.  Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm , 2003, J. Intell. Manuf..

[28]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[29]  Mitsuo Gen,et al.  Spanning Tree-based Genetic Algorithm for Solving Bicriteria Transportation Problem , 1998 .

[30]  Douglas J. Thomas,et al.  Coordinated supply chain management , 1996 .

[31]  Mitsuo Gen,et al.  Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.

[32]  C. Berek,et al.  The maturation of the immune response. , 1993, Immunology today.

[33]  Reza Tavakkoli-Moghaddam,et al.  A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time , 2009, Comput. Ind. Eng..

[34]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[35]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[36]  Mitsuo Gen,et al.  Hybrid genetic algorithm for multi-time period production/distribution planning , 2005, Comput. Ind. Eng..

[37]  M. Gen,et al.  Hybrid Genetic Algorithm for Production/Distribution System in Supply Chain , 2003 .

[38]  Mitsuo Gen,et al.  Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm , 2007, Comput. Ind. Eng..

[39]  James Brian Quinn,et al.  Technology in services , 1987 .

[40]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..

[41]  José L. Verdegay.  Fuzzy Sets Based Heuristics for Optimization , 2010 .

[42]  Jesús Sáez Aguado.  Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems , 2009, Ann. Oper. Res..

[43]  Hasan Pirkul,et al.  A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution , 1998, Comput. Oper. Res..

[44]  I. C. Parmee.  Adaptive Computing in Design and Manufacture , 1998 .

[45]  Suat Tanaydin.  Robust Design and Analysis for Quality Engineering , 1996 .

[46]  M. Gen,et al.  Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach , 2002 .

[47]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[48]  Raid Al-Aomar,et al.  Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs , 2006, Simul. Model. Pract. Theory.

[49]  K. Hindi,et al.  Efficient Solution of a Multi-commodity, Two-stage Distribution Problem with Constraints on Assignment of Customers to Distribution Centres , 1998 .

[50]  J. O'Brien,et al.  Introduction to Information System , 2010 .

[51]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[52]  Leandro Nunes de Castro,et al.  Artificial Immune Systems: A New Computational Approach , 2002 .

[53]  M. Gen,et al.  Solving Multi-objective Transportation Problems by Spanning Tree-based Genetic Algorithm , 1998 .