Improved Genetic Algorithm for Fixed Charge Transportation Problem

被引:1
|
作者
Yang, Tao [1 ]
Shao, Liangshan [2 ]
机构
[1] Liaoning Tech Univ, Coll Business Adm, Huludao 125105, Peoples R China
[2] Liaoning Tech Univ, Syst Engn Res Inst, Fuxing 123000, Peoples R China
关键词
D O I
10.1109/ISCID.2008.207
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To improve the performance of genetic algorithm based on edge sets code (ES) for solving the fixed charge transportation problem (FCTP), an improved genetic algorithm which has a multi point crossover operator appending edges to forest (MPC-ES) is developed for the spanning tree based on the sorted edge sets code attained by root-first search. The algorithm complexity of MPC-ES is analyzed, and the computational results demonstrate that along with the increase of FCTP sizes and types, the solution quality among ES, sorted edge sets(S-ES) and MPC-ES code shows descending tendency. But MPC-ES can obtain better solutions than those based on ES and S-ES code; and the cost of CPU time among them become longer, S-ES is less than ES, and MPC-ES appreciably less than S-ES
引用
收藏
页码:379 / +
页数:3
相关论文
共 50 条
  • [31] On the structure of the fixed charge transportation problem
    Kowalski, K.
    INTERNATIONAL JOURNAL OF MATHEMATICAL EDUCATION IN SCIENCE AND TECHNOLOGY, 2005, 36 (08) : 879 - 888
  • [32] The noncooperative fixed charge transportation problem
    Sagratella, Simone
    Schmidt, Marcel
    Sudermann-Merx, Nathan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (01) : 373 - 382
  • [33] An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem
    Cosma, Ovidiu
    Pop, Petrica C.
    Sabo, Cosmin
    HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2019, 2019, 11734 : 157 - 167
  • [34] Solving the Fuel Transportation Problem Based on the Improved Genetic Algorithm
    Ma, Yingjun
    Cui, Xueyuan
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 584 - 588
  • [35] Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm
    Hajiaghaei-Keshteli, M.
    Molla-Alizadeh-Zavardehi, S.
    Tavakkoli-Moghaddam, R.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (02) : 259 - 271
  • [36] NEW BRANCH-AND-BOUND ALGORITHM FOR FIXED-CHARGE TRANSPORTATION PROBLEM
    KENNINGTON, J
    UNGER, E
    MANAGEMENT SCIENCE, 1976, 22 (10) : 1116 - 1126
  • [37] A simple algorithm for the source-induced fixed-charge transportation problem
    Adlakha, V
    Kowalski, K
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (12) : 1275 - 1280
  • [38] A branching method for the fixed charge transportation problem
    Adlakha, Veena
    Kowalski, Krzysztof
    Lev, Benjamin
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2010, 38 (05): : 393 - 397
  • [39] On step fixed-charge transportation problem
    Kowalski, Krzysztof
    Lev, Benjamin
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2008, 36 (05): : 913 - 917
  • [40] Paradox in The d-Dimensional Fixed Charge Transportation Problem and Algorithm for Finding The Paradox
    Silalahi, Bib Paruhum
    Sulistyono, Eko
    Bukhari, Fahren
    PAKISTAN JOURNAL OF STATISTICS AND OPERATION RESEARCH, 2022, 18 (02) : 329 - 336