Optimal network flow: A predictive analytics perspective on the fixed-charge network flow problem

被引:3
|
作者
Nicholson, Charles D. [1 ]
Zhang, Weili [1 ]
机构
[1] Univ Oklahoma, Sch Ind & Syst Engn, 202 W Boyd St,Room 442, Norman, OK 73019 USA
关键词
Network analysis; Fixed charge network flow; Predictive modeling; Critical components; ARTIFICIAL IMMUNE; RELIABILITY; ALGORITHM; MODELS; NEIGHBORHOODS; PERFORMANCE; DESIGN;
D O I
10.1016/j.cie.2016.07.030
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The fixed charge network flow (FCNF) problem is a classical NP-hard combinatorial problem with wide spread applications. To the best of our knowledge, this is the first paper that employs a statistical learning technique to analyze and quantify the effect of various network characteristics relating to the optimal solution of the FCNF problem. In particular, we create a probabilistic classifier based on 18 network related variables to produce a quantitative measure that an arc in the network will have a non-zero flow in an optimal solution. The predictive model achieves 85% cross-validated accuracy. An application employing the predictive model is presented from the perspective of identifying critical network components based on the likelihood of an arc being used in an optimal solution. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:260 / 268
页数:9
相关论文
共 50 条
  • [11] A branch-and-cut algorithm uncapacitated, fixed-charge for the single-commodity, network flow problem
    Ortega, F
    Wolsey, LA
    NETWORKS, 2003, 41 (03) : 143 - 158
  • [12] Three-Partition Flow Cover Inequalities for Constant Capacity Fixed-Charge Network Flow Problems
    Atamturk, Alper
    Gomez, Andres
    Kucukyavuz, Simge
    NETWORKS, 2016, 67 (04) : 299 - 315
  • [13] Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem
    Hewitt, Mike
    Nemhauser, George
    Savelsbergh, Martin W. P.
    INFORMS JOURNAL ON COMPUTING, 2013, 25 (02) : 302 - 316
  • [14] An Efficient Matheuristic for the Multicommodity Fixed-Charge Network Design Problem
    Gendron, Bernard
    Hanafi, Said
    Todosijevic, Raca
    IFAC PAPERSONLINE, 2016, 49 (12): : 117 - 120
  • [15] New models of the generalized fixed-charge network design problem
    Pop, Petrica C.
    Sitar, Corina Pop
    CARPATHIAN JOURNAL OF MATHEMATICS, 2012, 28 (01) : 143 - 150
  • [16] A sequential reduction algorithm for the large-scale fixed-charge network flow problems
    Lu Yang
    Zhouwang Yang
    Optimization Letters, 2024, 18 : 1131 - 1149
  • [17] Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach
    Hak-Jin Kim
    John N. Hooker
    Annals of Operations Research, 2002, 115 : 95 - 124
  • [18] Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
    Kim, HJ
    Hooker, JN
    ANNALS OF OPERATIONS RESEARCH, 2002, 115 (1-4) : 95 - 124
  • [19] A Dynamic Method to Solve the Fixed Charge Network Flow Problem
    Nie, Zhibin
    Wang, Shuning
    IFAC PAPERSONLINE, 2020, 53 (02): : 11231 - 11236
  • [20] A sequential reduction algorithm for the large-scale fixed-charge network flow problems
    Yang, Lu
    Yang, Zhouwang
    OPTIMIZATION LETTERS, 2024, 18 (05) : 1131 - 1149