Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation

This paper presents a mathematical model for a capacitated fixed-charge transportation problem in a two-stage supply chain network, in which potential places are candidate to be as distribution centers (DCs) and customers with particular demands. In contrast with the previous studies considered ample capacity for DCs, we consider the capacity for each DC. The presented model minimizes the total cost in such a way that some DCs are selected in order to supply demands of all the customers. To tackle such an NP-hard problem, we propose an artificial immune algorithm (AIA) and a genetic algorithm (GA) based on the spanning tree and Prufer number representation. We introduce a new method to calculate the affinity value by using an adjustment rate. Furthermore, we apply the Taguchi experimental design method to set the proper values of AIA and GA parameters in order to improve their performances. Finally, we investigate the impact of increasing the problem size on the performance of our proposed algorithms.

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

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

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

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

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

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

[7]  Moustapha Diaby,et al.  Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems , 1991 .

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

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

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

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

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

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

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

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

[16]  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..

[17]  Prakash J. Singh,et al.  Supply chain management: a structured literature review and implications for future research , 2006 .

[18]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[19]  Zhou Ji,et al.  Artificial immune system (AIS) research in the last five years , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[20]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

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

[22]  Philip Payne,et al.  Research frameworks in logistics: three models, seven dinners and a survey , 1995 .

[23]  Arshinder,et al.  Supply chain coordination: Perspectives, empirical studies and research directions , 2008 .

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

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

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

[27]  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..

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

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

[30]  L.N. de Castro,et al.  An artificial immune network for multimodal function optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[31]  J. Gottlieb,et al.  Genetic algorithms for the fixed charge transportation problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[32]  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..

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

[34]  Mark S. Fox,et al.  Agent-Oriented Supply-Chain Management , 2000 .

[35]  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..

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

[37]  Bernhard Tilanus,et al.  Information Systems in Logistics and Transportation , 1997 .

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

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

[40]  Veena Adlakha,et al.  On the fixed-charge transportation problem , 1999 .

[41]  Chui-Yu Chiu,et al.  Applying artificial immune system and ant algorithm in air-conditioner market segmentation , 2009, Expert Syst. Appl..

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

[43]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

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

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