Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm

This article considers the two-stage fixed-charge transportation problem which models an important transportation application in a supply chain, from manufacturers to customers through distribution centers. For solving this optimization problem we describe a hybrid algorithm that combines a steady-s...

Full description

Saved in:
Bibliographic Details
Published inCarpathian Journal of Mathematics Vol. 33; no. 3; pp. 365 - 371
Main Authors Pop, Petrică C., Sabo, Cosmin, Biesinger, Benjamin, Hu, Bin, Raidl, Günther R.
Format Journal Article
LanguageEnglish
Published Sinus Association 01.01.2017
Subjects
Algorithms
Crossovers
Genetic algorithms
Heuristics
Hybridity
Marketing strategies
Mathematics
Supply
Supply chain management
Transportation
Online AccessGet full text

Cover

More Information
Summary:This article considers the two-stage fixed-charge transportation problem which models an important transportation application in a supply chain, from manufacturers to customers through distribution centers. For solving this optimization problem we describe a hybrid algorithm that combines a steady-state genetic algorithm with a local search procedure. The computational results for an often used collection of benchmark instances show that our proposed hybrid method delivers results that are competitive to those of other state-of-the-art algorithms for solving the two-stage fixed-charge transportation problem.
ISSN:1584-2851
1843-4401
DOI:10.37193/CJM.2017.03.11