Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem

References

• Chopra S, Meindl P. Supply chain management: strategy, planning and operation. 3rd ed. Upper Saddle River, NJ: Pearson Prentice Hall; 2007.
   Google Scholar
• Garey MR, Johnson DS. Computers and Intractability: a guide to the theory of NP-completeness. New York (NY): W.H. Freeman; 1979.
   Google Scholar
• DuraiRaj KAA, Rajendran C. A genetic algorithm for solving the fixed-charge transportation model: two-stage problem. Comput. Oper. Res. 2012;39:2016–2032.
   Web of Science ®Google Scholar
• Vinay VP, Vanga R, Sridharan R. Ant colony optimisation algorithm for distribution-allocation problem in a two-stage supply chain with a fixed transportation charge. Int. J. Prod. Res. 2013;51:698–717.
   Web of Science ®Google Scholar
• El-Sherbiny MM. Alternate mutation based artificial immune algorithm for step fixed charge transportation problem. Egypt. Inform. J. 2012;13:123–134.10.1016/j.eij.2012.05.003
   Google Scholar
• Alhamali RM, El-Sherbiny MM. A hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem. Comput. Ind. Eng. 2013;64:610–620.
   Web of Science ®Google Scholar
• Jawahar N, Balaji AN. A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge. Eur. J. Oper. Res. 2009;194:496–537.10.1016/j.ejor.2007.12.005
   Web of Science ®Google Scholar
• Gen M, Kumar A, Kim JR. Recent network design techniques using evolutionary algorithms. Int. J. Prod. Econ. 2005;98:251–261.
   Web of Science ®Google Scholar
• Yang L, Liu L. Fuzzy fixed charge solid transportation problem and algorithm. Appl. Soft Comp. 2007;7:879–889.
   Web of Science ®Google Scholar
• Hofmeyr SA, Forrest S. Architecture for an artificial immune system. Evol. Comput. 2000;8:443–473.
   PubMed Web of Science ®Google Scholar
• De Castro LN, Von Zuben FJ. Artificial immune systems: part I–basic theory and applications. Universidade Estadual de Campinas, December, Tech. Rep. 1999;210.
   Google Scholar
• Kodaz H, Özşen S, Arslan A, Güneş S. Medical application of information gain based artificial immune recognition system (AIRS): Diagnosis of thyroid disease. Expert Syst. Appl. 2009;36:3086–3092.
   Web of Science ®Google Scholar
• Coello, CAC, Cortés, NC. An approach to solve multiobjective optimization problems based on an artificial immune system. In: Timmis J, Bentley PJ, editors. Published in the proceedings of 1st International Conference on Artificial Immune Systems (ICARIS); 2002 September; Canterbury (UK): University of Kent.
   Google Scholar
• Omkar SN, Khandelwal R, Yathindra S, Narayana Naik G, Gopalakrishnan S. Artificial immune system for multi-objective design optimization of composite structures. Eng. Appl. Artif. Intell. 2008;21:1416–1429.10.1016/j.engappai.2008.01.002
   Web of Science ®Google Scholar
• Basu M. Bee colony optimization for combined heat and power economic dispatch. Expert Syst. Appl. 2011;38:13527–13531.
   Web of Science ®Google Scholar
• Liao GC, Tsao TP. Application of a fuzzy neural network combined with a chaos genetic algorithm and simulated annealing to short-term load forecasting. IEEE T. Evolut. Comput. 2006;10:330–340.
   Web of Science ®Google Scholar
• Nara K, Takeyama T, Kim H. A new evolutionary algorithm based on sheep flocks heredity model and its application to scheduling problem. In Systems, Man, and Cybernetics, 1999. IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference (Vol. 6, pp. 503–508). IEEE.
   Google Scholar
• Anandaraman C. An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems. Int. J. Ind. Eng. Comput. 2011;2:749–764.
   Google Scholar
• Subbiah S, Tometzki T, Panek S, Engell S. Multi-product batch scheduling with intermediate due dates using priced timed automata models. Comput. Chem. Eng. 2009;33:1661–1676.
   Web of Science ®Google Scholar
• Mukherjee R, Chakraborty S, Samanta S. Selection of wire electrical discharge machining process parameters using non-traditional optimization algorithms. Appl. Soft Comput. 2012;12:2506–2516.10.1016/j.asoc.2012.03.053
   Web of Science ®Google Scholar
• Steinberg DI. The fixed charge problem. Nav. Res. Log. Q. 1970;17:217–235.10.1002/(ISSN)1931-9193
   Google Scholar
• Gray P. Technical note – exact solution of the fixed-charge transportation problem. Oper. Res. 1971;19:1529–1538.10.1287/opre.19.6.1529
   Web of Science ®Google Scholar
• Kennington J, Unger E. A new branch-and-bound algorithm for the fixed-charge transportation problem. Manage. Sci. 1976;22:1116–1126.10.1287/mnsc.22.10.1116
   Web of Science ®Google Scholar
• McKeown PG. A branch-and-bound algorithm for solving fixed charge problems. Nav. Res. Log. Q. 1981;28:607–617.10.1002/(ISSN)1931-9193
   Google Scholar
• Cabot AV, Erenguc SS. Some branch-and-bound procedures for fixed-cost transportation problems. Nav. Res. Log. Q. 1984;31:145–154.10.1002/(ISSN)1931-9193
   Google Scholar
• Schaffer JR, O’Leary DE. Use of penalties in a branch and bound procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 1989;43:305–312.10.1016/0377-2217(89)90229-4
   Web of Science ®Google Scholar
• Palekar US, Karwan MH, Zionts S. A branch-and-bound method for the fixed charge transportation problem. Manage. Sci. 1990;36:1092–1105.10.1287/mnsc.36.9.1092
   Web of Science ®Google Scholar
• Herer YT, Rosenblatt MJ. Fast algorithms for single-sink fixed charge transportation problems with applications to manufacturing and transportation. Transport. Sci. 1996;30:276–290.10.1287/trsc.30.4.276
   Web of Science ®Google Scholar
• Bell GJ, Lamar BW, Wallace CA. Capacity improvement, penalties, and the fixed charge transportation problem. Nav. Res. Log. 1999;46:341–355.10.1002/(ISSN)1520-6750
   Web of Science ®Google Scholar
• Kim H-J, Hooker JN. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming. Ann. Oper. Res. 2002;115:95–124.10.1023/A:1021145103592
   Web of Science ®Google Scholar
• Ortega F, Wolsey LA. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks. 2003;41:143–158.10.1002/net.10068
   Web of Science ®Google Scholar
• Walker WE. A heuristic adjacent extreme point algorithm for the fixed charge problem. Manage. Sci. 1976;22:587–596.10.1287/mnsc.22.5.587
   Web of Science ®Google Scholar
• Balakrishnan A, Magnanti TL, Wong RT. A dual-ascent procedure for large-scale uncapacitated network design. Opera. Res. 1989;37:716–740.10.1287/opre.37.5.716
   Web of Science ®Google Scholar
• Kim D, Pardalos PM. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 1999;24:195–203.10.1016/S0167-6377(99)00004-8
   Web of Science ®Google Scholar
• Xie F, Jia R. Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm. Comput. Ind. Eng. 2012;63:763–778.
   Web of Science ®Google Scholar
• Lotfi MM, Tavakkoli-Moghaddam R. A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Appl. Soft Comput. 2013;13:2711–2726.10.1016/j.asoc.2012.11.016
   Web of Science ®Google Scholar
• Vinay VP, Sridharan R. Development and analysis of heuristic algorithms for a two-stage supply chain allocation problem with a fixed transportation cost. Int. J. Serv. Oper. Manage. 2012;12:244–268.10.1504/IJSOM.2012.047107
   Google Scholar
• Noorul Haq A, Kannan G. Design of an integrated supplier selection and multi-echelon distribution inventory model in a built-to-order supply chain environment. Int. J. Prod. Res. 2006;44:1963–1985.
   Web of Science ®Google Scholar
• Kannan G, Sasikumar P, Devika K. A genetic algorithm approach for solving a closed loop supply chain model: A case of battery recycling. Appl. Math. Model. 2010;34:655–670.
   Web of Science ®Google Scholar
• Diabat A, Kannan D, Kaliyan M, Svetinovic D. An optimization model for product returns using genetic algorithms and artificial immune system. Resour. Conserv. Recycl. 2013;74:156–169.10.1016/j.resconrec.2012.12.010
   Web of Science ®Google Scholar
• De Castro LN, Timmis J. Artificial immune systems: a new computational intelligence approach. Berlin: Springer-Verlag; 2002.
   Google Scholar
• Kannan G, Sasi Kumar P, Vinay VP. Comments on “Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm” by Jung-Bok Jo, Yinzhen Li, Mitsuo Gen, Comput. Ind. Eng. 2007. Comput. Ind. Eng. 2008;55:533–534.
   Google Scholar
• Prakash A, Deshmukh SG. A multi-criteria customer allocation problem in supply chain environment: an artificial immune system with fuzzy logic controller based approach. Expert Syst. Appl. 2011;38:3199–3208.
   Web of Science ®Google Scholar
• Chandrasekaran M, Asokan P, Kumanan S, Balamurugan T. Sheep flocks heredity model algorithm for solving job shop scheduling problems. Int. J. Appl. Manage. Technol. 2006;4:79–100.
   Google Scholar
• Wright D, von Lanzenauer C. COAL: a new heuristic approach for solving the fixed charge problem – computational results. Eur. J. Oper. Res. 1991;52:235–246.10.1016/0377-2217(91)90084-9
   Web of Science ®Google Scholar
• Adlakha V, Kowalski K. A simple heuristic for solving small fixed-charge transportation problems. Omega. 2003;31:205–211.10.1016/S0305-0483(03)00025-2
   Web of Science ®Google Scholar
• Amiri A. Designing a distribution network in a supply chain system: formulation and efficient solution procedure. Eur. J. Oper. Res. 2006;171:567–576.10.1016/j.ejor.2004.09.018
   Web of Science ®Google Scholar
• Adlakha V, Kowalski K, Vemuganti R, Lev B. More-for-less algorithm for fixed-charge transportation problems. Omega. 2007;35:116–127.10.1016/j.omega.2006.03.001
   Web of Science ®Google Scholar
• Sun M, Aronson JE, McKeown PG, Drinka D. A tabu search heuristic procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 1998;106:441–456.10.1016/S0377-2217(97)00284-1
   Web of Science ®Google Scholar
• Jo JB, Li Y, Gen M. Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput. Ind. Eng. 2007;53:290–298.
   Web of Science ®Google Scholar
• Hajiaghaei-Keshteli M, Molla-Alizadeh-Zavardehi S, Tavakkoli-Moghaddam R. Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Comput. Ind. Eng. 2010;59:259–271.
   Web of Science ®Google Scholar