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 条
  • [31] Heuristic algorithms for the fixed-charge transportation problem
    Veena Adlakha
    Krzysztof Kowalski
    R. R. Vemuganti
    OPSEARCH, 2006, 43 (2) : 132 - 151
  • [32] LOT SIZING AS A FIXED-CHARGE PROBLEM.
    Bahl, Harish C.
    Zionts, Stanley
    Production and inventory management Washington, D.C., 1986, 27 (01): : 1 - 11
  • [33] EXACT SOLUTION OF FIXED-CHARGE TRANSPORTATION PROBLEM
    GRAY, P
    OPERATIONS RESEARCH, 1971, 19 (06) : 1529 - &
  • [34] On the Use of Guided Design Search for Discovering Significant Decision Variables in the Fixed-Charge Capacitated Multicommodity Network Design Problem
    Lewis, Mark W.
    NETWORKS, 2009, 53 (01) : 6 - 18
  • [35] A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem
    Munguia, Lluis-Miquel
    Ahmed, Shabbir
    Bader, David A.
    Nemhauser, George L.
    Goel, Vikas
    Shao, Yufen
    COMPUTERS & OPERATIONS RESEARCH, 2017, 77 : 44 - 57
  • [36] Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
    Hewitt, Mike
    Nemhauser, George L.
    Savelsbergh, Martin W. P.
    INFORMS JOURNAL ON COMPUTING, 2010, 22 (02) : 314 - 325
  • [37] Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design
    Ghamlouche, I
    Crainic, TG
    Gendreau, M
    OPERATIONS RESEARCH, 2003, 51 (04) : 655 - 667
  • [38] A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
    Paraskevopoulos, Dimitris C.
    Bektas, Tolga
    Crainic, Teodor Gabriel
    Potts, Chris N.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (02) : 265 - 279
  • [39] A VERTEX RANKING ALGORITHM FOR THE FIXED-CHARGE TRANSPORTATION PROBLEM
    SADAGOPAN, S
    RAVINDRAN, A
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1982, 37 (02) : 221 - 230
  • [40] OPTIMAL DESIGN OF REGIONAL WASTEWATER SYSTEMS - FIXED-CHARGE NETWORK FLOW MODEL
    JARVIS, JJ
    RARDIN, RL
    UNGER, VE
    MOORE, RW
    SCHIMPELER, CC
    OPERATIONS RESEARCH, 1978, 26 (04) : 538 - 550
12345