Indian Journal of Science and Technology
Year: 2014, Volume: 7, Issue: 7, Pages: 949-954
S. Molla-Alizadeh-Zavardehi1 , A. Mahmoodirad2* and M. Rahimian2
1 Department of Industrial Engineering, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran; [email protected]
2 Department of Mathematics, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran; [email protected]
In this paper, we consider the step fixed-charge transportation problem where is one of the most important problems in transportation research area. To tackle such an NP-hard problem, we present Genetic Algorithm (GA). Since crossover and mutation operators have significant role on the algorithm’s quality, some crossover and mutation operators are tested in this work. For this aim, several problem sizes are generated at random and then through extensive computational experiments, appropriate GA parameter values were chosen. Besides, the efficiency and convergence of the proposed algorithms was evaluated by solution quality. The results showed that the GA was more robust and consistently outperformed Simulated Annealing (SA) for all instances.
Keywords: Genetic Algorithm, Step Fixed Charge Transportation Problem, Transportation Problem
Subscribe now for latest articles and news.