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 条
  • [1] Solving to optimality the uncapacitated fixed-charge network flow problem
    Cruz, F.R.B.
    Smith, J.MacGregor
    Mateus, G.R.
    Computers and Operations Research, 1998, 25 (01): : 67 - 81
  • [2] Solving to optimality the uncapacitated fixed-charge network flow problem
    Cruz, FRB
    Smith, JM
    Mateus, GR
    COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (01) : 67 - 81
  • [3] 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
  • [4] 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
  • [5] 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
  • [6] New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem
    Kazemi, Ahmad
    Le Bodic, Pierre
    Ernst, Andreas T.
    Krishnamoorthy, Mohan
    COMPUTERS & OPERATIONS RESEARCH, 2021, 136
  • [7] PATH COVER AND PATH PACK INEQUALITIES FOR THE CAPACITATED FIXED-CHARGE NETWORK FLOW PROBLEM
    Atamturk, Alper
    Kucukyavuz, Simge
    Tezel, Birce
    SIAM JOURNAL ON OPTIMIZATION, 2017, 27 (03) : 1943 - 1976
  • [8] The generalized fixed-charge network design problem
    Thomadsen, Tommy
    Stidsen, Thomas
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (04) : 997 - 1007
  • [9] A dynamic slope scaling procedure for the fixed-charge cost multi-commodity network flow problem
    Eksioglu, SD
    Pardalos, PM
    Romeijn, HE
    FINANCIAL ENGINEERING, E-COMMERCE AND SUPPLY CHAIN, 2002, 70 : 247 - 270
  • [10] APPROXIMATE SOLUTIONS OF CAPACITATED FIXED-CHARGE MINIMUM COST NETWORK FLOW PROBLEMS
    KHANG, DB
    FUJIWARA, O
    NETWORKS, 1991, 21 (06) : 689 - 704