A COMBINED HEURISTIC APPROACH TO THE NONLINEAR FIXED-HARGE CAPACITATED NETWORK DESIGN PROBLEM

被引:0
|
作者
Yoo, Woo-Sik [1 ]
Kim, Jae-Gon [1 ]
Kim, Chong-Man [2 ]
机构
[1] Incheon Natl Univ, Dept Ind & Management Engn, Inchon, South Korea
[2] Myongji Univ, Dept Ind & Management Engn, Yongin, Gyeonggi Do, South Korea
关键词
nonlinear fixed-charge capacitated network design; heuristic; simulated annealing; FLOW PROBLEMS; COST FLOWS; ALGORITHMS; MODELS;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The nonlinear fixed-charge capacitated network design problem (NFCNDP) is notoriously difficult and there is limited literature addressing this problem although the (linear) fixed-charge capacitated network design problem has been extensively studied. In this article, we propose a new heuristic approach to the NFCNDP. We develop a two-phase heuristic algorithm in which a constructive method is used to obtain an initial solution and the solution is iteratively improved using an improvement method. To overcome the myopia of the heuristic algorithm, we combine it with simulated annealing. Computational experiments are performed on benchmark test sets with convex and concave cost functions. Test results show that the suggested algorithm performs much better than commercial optimization solvers.
引用
收藏
页码:83 / 93
页数:11
相关论文
共 50 条
  • [1] A combined heuristic approach to the nonlinear fixedcharge capacitated network design problem
    [J]. Kim, Chong-Man (chongman@mju.ac.kr), 1600, University of Cincinnati (23):
  • [2] A combined fast greedy heuristic for the capacitated multicommodity network design problem
    Katayama, Naoto
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (11) : 1983 - 1996
  • [3] A local branching heuristic for the capacitated fixed-charge network design problem
    Rodriguez-Martin, Inmaculada
    Salazar-Gonzalez, Juan Jose
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (03) : 575 - 581
  • [4] Hybrid heuristic for Capacitated Network Design Problem
    Khelifi, M.
    Babes, M.
    Ghanemi, S.
    Saidi, M.
    Boudjit, S.
    [J]. JOURNAL OF HIGH SPEED NETWORKS, 2015, 21 (04) : 313 - 330
  • [5] A dual ascent approach to the fixed-charge capacitated network design problem
    Herrmann, JW
    Ioannou, G
    Minis, I
    Proth, JM
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 95 (03) : 476 - 490
  • [6] A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
    Holmberg, K
    Yuan, D
    [J]. OPERATIONS RESEARCH, 2000, 48 (03) : 461 - 481
  • [7] A capacity scaling heuristic for the multicommodity capacitated network design problem
    Katayama, N.
    Chen, M.
    Kubo, M.
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 232 (01) : 90 - 101
  • [8] A Two-phase Heuristic Algorithm for the Fixed-charge Capacitated Network Design Problem with Turn Penalties
    Kim, Jae-Gon
    Jun, Hong-Bae
    Kim, Chong-Man
    [J]. KSCE JOURNAL OF CIVIL ENGINEERING, 2011, 15 (06) : 1125 - 1132
  • [9] A two-phase heuristic algorithm for the fixed-charge capacitated network design problem with turn penalties
    Jae-Gon Kim
    Hong-Bae Jun
    Chong-Man Kim
    [J]. KSCE Journal of Civil Engineering, 2011, 15 : 1125 - 1132
  • [10] Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
    Hewitt, Mike
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    [J]. INFORMS JOURNAL ON COMPUTING, 2010, 22 (02) : 314 - 325