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

被引：0
|
作者：
Pop, Petrica C. [1 ]
Sabo, Cosmin [1 ]
Biesinger, Benjamin [2 ]
Hu, Bin [2 ]
Raid, Guenther R. [3 ]
机构：
[1] Tech Univ Cluj Napoca, North Univ Ctr Baia Mare, Dept Math & Comp Sci, Victoriei 76, Baia Mare, Romania
[2] AIT, Ctr Mobil Syst Dynam Transportat Syst, Giefinggasse 2, A-1210 Vienna, Austria
[3] TU Wien, Inst Algorithms & Comp Graph, Vienna, Austria
来源：
CARPATHIAN JOURNAL OF MATHEMATICS | 2017年 / 33卷 / 03期
关键词：
Transportation problem; supply chain; two-stage fixed-charge transportation problem; genetic algorithm; DISTRIBUTION-SYSTEM; CHAIN NETWORK; MULTICOMMODITY; DESIGN;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：365 / 371
页数：7
相关论文
共 50 条
  • [1] An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem
    Cosma, Ovidiu
    Pop, Petrica C.
    Sabo, Cosmin
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2019, 2019, 11734 : 157 - 167
  • [2] A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem
    Raj, K. Antony Arokia Durai
    Rajendran, Chandrasekharan
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2016 - 2032
  • [3] A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem
    Cosma, Ovidiu
    Pop, Petrica C.
    Danciulescu, Daniela
    [J]. INFORMATICA, 2020, 31 (04) : 681 - 706
  • [4] A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem
    Cosma, Ovidiu
    Pop, Petrica
    Oliviu, Matei
    Zelina, Ioana
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS (HAIS 2018), 2018, 10870 : 684 - 693
  • [5] A matheuristic for the two-stage fixed-charge transportation problem
    Calvete, Herminia, I
    Gale, Carmen
    Iranzo, Jose A.
    Toth, Paolo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 95 : 113 - 122
  • [6] A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem
    Pop, Petrica
    Matei, Oliviu
    Sitar, Corina Pop
    Zelina, Ioana
    [J]. CARPATHIAN JOURNAL OF MATHEMATICS, 2016, 32 (02) : 225 - 232
  • [7] An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem
    Cosma, Ovidiu
    Pop, Petrica C.
    Sitar, Corina Pop
    [J]. CARPATHIAN JOURNAL OF MATHEMATICS, 2019, 35 (02) : 153 - 164
  • [8] An improved hybrid algorithm for capacitated fixed-charge transportation problem
    Pintea, Camelia-M.
    Pop, Petrica C.
    [J]. LOGIC JOURNAL OF THE IGPL, 2015, 23 (03) : 369 - 378
  • [9] Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
    Kannan, Devika
    Govindan, Kannan
    Soleimani, Hamed
    [J]. OPTIMIZATION, 2014, 63 (10) : 1465 - 1479
  • [10] A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes
    Cosma, Ovidiu
    Pop, Petrica C.
    Sabo, Cosmin
    [J]. SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 417 - 428
12345