Open Access Open Access  Restricted Access Subscription Access

Step Fixed Charge Transportation Problems via Genetic Algorithm


Affiliations
1 Department of Industrial Engineering, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran, Islamic Republic of
2 Department of Mathematics, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran, Islamic Republic of
 

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
User

Abstract Views: 226

PDF Views: 0




  • Step Fixed Charge Transportation Problems via Genetic Algorithm

Abstract Views: 226  |  PDF Views: 0

Authors

S. Molla-Alizadeh-Zavardehi
Department of Industrial Engineering, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran, Islamic Republic of
A. Mahmoodirad
Department of Mathematics, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran, Islamic Republic of
M. Rahimian
Department of Mathematics, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran, Islamic Republic of

Abstract


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



DOI: https://doi.org/10.17485/ijst%2F2014%2Fv7i7%2F54311