Hybrid algorithms for fixed charge transportation problem
Nermin Kartli (2025)
Kybernetika
Similarity:
In this paper, we consider the fixed-cost transportation problem. This problem is known to be NP-hard. Therefore, various heuristic and metaheuristic approaches have been proposed to find an approximate optimal solution. In this paper, we propose three hybrid algorithms that combine the ideas of metaheuristic and heuristic approaches in different ways. Two of the proposed algorithms consist of the sequential implementation of metaheuristic and heuristic algorithms, while the third one...