HYBRID ALGORITHMS FOR FIXED CHARGE TRANSPORTATION PROBLEM

KARTLI N.

Kybernetika, cilt.61, sa.2, ss.141-167, 2025 (SCI-Expanded, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 61 Sayı: 2
  • Basım Tarihi: 2025
  • Doi Numarası: 10.14736/kyb-2025-2-0141
  • Dergi Adı: Kybernetika
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Linguistic Bibliography, zbMATH
  • Sayfa Sayıları: ss.141-167
  • Anahtar Kelimeler: fixed charge transportation problem, genetic algorithms, metaheuristic algorithms, transportation problem
  • Ankara Üniversitesi Adresli: Evet

Özet

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 is a full hybrid algorithm designed by completely intertwining these two approaches. Experimental results on medium-size problems show that our proposed full hybrid algorithm provides approximately a 5% improvement over metaheuristic algorithms and a 4% improvement over heuristic algorithms. In addition, the improvement ratio increases as the size of the problem increases.