Genetic algorithm with immigration strategy to solve the fixed charge transportation problem

This paper is about improving the performance of genetic algorithm (GA) to solve the fixed-charge transportation problem (FCTP). Several approaches have been developed, based on adaptation and improvement of genetic operators. We propose a new genetic algorithm adopting an immigration strategy to maintain the diversity in the population and then overcome the stagnation of the values of the objective function. Thereby, we applied two types of immigration, random immigration and memory-based immigration. The numerical results obtained with several standard instances of the FCTP problem demonstrate the effectiveness of these strategies in improving the performance of the GA. Especilly, for the second strategy.