SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

International Journal of Mathematical Modelling & Computations

مقاله 8، دوره 4، 2 (SPRING)، فروردین 2014، صفحه 177-187   

نویسندگان

Saber Molla-Alizadeh-Zavardehi¹؛ Masoud Sanei²؛ Reza Soltani³؛ Ali Mahmoodirad⁴

¹Department of Industrial Engineering, Masjed Soleyman Branch, Islamic Azad University, Masjed Soleyman, Iran.

²Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran. Iran, Islamic Republic of

³Department of Industrial Engineering, Masjed Soleyman Branch, Islamic Azad University, Masjed Soleyman, Iran. Iran, Islamic Republic of

⁴Department of Mathematics, Masjed Soleyman Branch, Islamic Azad University, Masjed Soleyman, Iran. Iran, Islamic Republic of

چکیده

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For comparing GA and MA, twenty eight problems with different specifics have been generated at random and then the quality of the proposed algorithms was evaluated using the relative percentage deviation (RPD) method. Finally, based on RPD method, we investigate the impact of increasing the problem size on the performance of our proposed algorithms.
 

کلیدواژه‌ها

Step Fixed Charge Transportation Problems؛ Genetic Algorithm؛ Memetic Algorithm؛ Spanning Tree