A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem

This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge transportation problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining a genetic algorithm based on a hash table coding of the individuals with a powerful local search procedure. The proposed algorithm was implemented and tested on an often used collection of benchmark instances and the computational results obtained showed that our proposed hybrid heuristic algorithm delivered competitive results compared to the state-of-the-art algorithms for solving the considered capacitated two-stage fixed-charge transportation problem.

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

[2]  Reza Tavakkoli-Moghaddam,et al.  Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation , 2011, Expert Syst. Appl..

[3]  Daniel E. O'Leary,et al.  Use of penalties in a branch and bound procedure for the fixed charge transportation problem , 1989 .

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

[5]  Petrica C. Pop,et al.  An efficient Reverse Distribution System for solving sustainable supply chain network design problem , 2015, J. Appl. Log..

[6]  Chandrasekharan Rajendran,et al.  A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem , 2012, Comput. Oper. Res..

[7]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[8]  John R. Koza,et al.  Concept Formation and Decision Tree Induction Using the Genetic Programming Paradigm , 1990, PPSN.

[9]  Petrica C. Pop.  Plenary lecture 2: on the generalized network design problems , 2009 .

[10]  Shengyong Chen,et al.  Modeling of Biological Intelligence for SCM System Optimization , 2011, Comput. Math. Methods Medicine.

[11]  A Bio-Inspired Approach for a Dynamic Railway Problem , 2007, Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007).

[12]  Mahmoud M. El-Sherbiny.  Comments on "Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation" by Molla-Alizadeh-Zavardehi, S. et al. Expert Systems with Applications (2011) , 2012, Expert Syst. Appl..

[13]  Petrica C. Pop,et al.  An improved hybrid algorithm for capacitated fixed-charge transportation problem , 2015, Log. J. IGPL.

[14]  S. Sethi,et al.  The Dynamic Transportation Problem: A Survey , 1980 .

[15]  Petrica C. Pop,et al.  A Hybrid Classical Approach to a Fixed-Charged Transportation Problem , 2012, HAIS.

[16]  Oliviu Matei,et al.  An efficient genetic algorithm for solving the generalized traveling salesman problem , 2010, Proceedings of the 2010 IEEE 6th International Conference on Intelligent Computer Communication and Processing.

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

[18]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.