New models of the generalized fixed-charge network design problem

被引：0
|
作者：
Pop, Petrica C. [1 ]
Sitar, Corina Pop [2 ]
机构：
[1] N Univ Baia Mare, Dept Math & Comp Sci, Baia Mare 430122, Romania
[2] Acad Romana, Iasi Branch, Bucharest, Romania
来源：
CARPATHIAN JOURNAL OF MATHEMATICS | 2012年 / 28卷 / 01期
关键词：
Network design; generalized fixed-charge network design problem; integer programming; TRAVELING SALESMAN PROBLEM; SPANNING TREE PROBLEM;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider in this paper the generalized fixed-charge network design (GFCND) problem in which we are interested to find the cheapest backbone network connecting exactly one hub from each of the given clusters. The GFCND problem belongs to the class of generalized combinatorial optimization problems. We describe two mixed integer programming formulations of the GFCND problem. Based on one of the new proposed formulations, we solve the GFCND problem to optimality using CPLEX for problems with up to 30 clusters and 200 nodes. Computational results are reported and compared with those from the literature.
引用
收藏
页码：143 / 150
页数：8
相关论文
共 50 条
  • [21] Profit-oriented fixed-charge network design with elastic demand
    Zetina, Carlos Armando
    Contreras, Ivan
    Cordeau, Jean-Francois
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 127 : 1 - 19
  • [22] Optimal network flow: A predictive analytics perspective on the fixed-charge network flow problem
    Nicholson, Charles D.
    Zhang, Weili
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 260 - 268
  • [23] The Fixed-Charge Shortest-Path Problem
    Engineer, Faramroze G.
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    Song, Jin-Hwa
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (04) : 578 - 596
  • [24] 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
    KSCE JOURNAL OF CIVIL ENGINEERING, 2011, 15 (06) : 1125 - 1132
  • [25] Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
    Fakhri, Ashkan
    Ghatee, Mehdi
    APPLIED MATHEMATICAL MODELLING, 2016, 40 (13-14) : 6468 - 6476
  • [26] NEW BRANCH-AND-BOUND ALGORITHM FOR FIXED-CHARGE TRANSPORTATION PROBLEM
    KENNINGTON, J
    UNGER, E
    MANAGEMENT SCIENCE, 1976, 22 (10) : 1116 - 1126
  • [27] Benders decomposition algorithms for the fixed-charge relay network design in telecommunications
    Kewcharoenwong, Panitan
    Uester, Halit
    TELECOMMUNICATION SYSTEMS, 2014, 56 (04) : 441 - 453
  • [28] Benders decomposition algorithms for the fixed-charge relay network design in telecommunications
    Panitan Kewcharoenwong
    Halit Üster
    Telecommunication Systems, 2014, 56 : 441 - 453
  • [29] Lagrangean relaxation algorithms for fixed-charge capacitated relay network design 
    Kewcharoenwong, Panitan
    Li, Qiaofeng
    Uester, Halit
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 121
  • [30] A survey on benders decomposition applied to fixed-charge network design problems
    Costa, AM
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (06) : 1429 - 1450
12345