Author/Authors :
Molla-Alizadeh-Zavardehi, S. Department of Industrial Engineering - Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran. , Sanei, M. Department of Mathematics - Central Tehran Branch, Islamic Azad University, Tehran, Iran , Soltani, R. Department of Industrial Engineering - Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran. , Mahmoodirad, A. Department of Mathematics - Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran
Abstract :
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.
Keywords :
Step Fixed Charge Transportation Problems , Genetic Algorithm , Memetic Algorithm , Spanning Tree
