solving the fixed charge transportation problem by new heuristic approach

The fixed charge transportation problem (fctp) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. since the problem is considered as an np-hard, the computational time grows exponentially as the size of the problem increases. in this paper, we propose a new heuristic along with well-known metaheuristic like genetic algorithm (ga), simulated annealing (sa) and recently developed one, keshtel algorithm (ka) to solve the fctp. contrary to previous works, we develop a simple and strong heuristic according to the nature of the problem and compare the result with metaheuristics. in addition, since the researchers recently used the priority-based representation to encode the transportation graphs and achieved very good results, we consider this representation in metaheuristics and compare the results with the proposed heuristic. furthermore, we apply the taguchi experimental design method to set the proper values of algorithms in order to improve their performances. finally, computational results of heuristic and metaheuristics with different encoding approaches, both in terms of the solution quality and computation time, are studied in different problem sizes.