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 条
  • [31] Flow pack facets of the single node fixed-charge flow polytope
    Atamtürk, A
    OPERATIONS RESEARCH LETTERS, 2001, 29 (03) : 107 - 114
  • [32] FRACTIONAL FIXED-CHARGE PROBLEM
    ALMOGY, Y
    LEVIN, O
    NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03): : 307 - &
  • [33] On the fixed-charge transportation problem
    Adlakha, V
    Kowalski, K
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (03): : 381 - 388
  • [34] Network flow assignment as a fixed point problem
    Krylatov A.Y.
    Journal of Applied and Industrial Mathematics, 2016, 10 (2) : 243 - 256
  • [35] VARIOUS APPROACHES TO SOLVE UNCAPACITATED FIXED-CHARGE FACILITY LOCATION PROBLEM ON POSTAL NETWORK
    Stefunko, Jozef
    Madlenak, Radovan
    CBU INTERNATIONAL CONFERENCE PROCEEDINGS 2016: INNOVATIONS IN SCIENCE AND EDUCATION, 2016, 4 : 192 - 198
  • [36] A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"
    Gendron, B
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 138 (03) : 671 - 675
  • [37] A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow
    Gonzalez, Pedro Henrique
    Simonetti, Luidi
    Michelon, Philippe
    Martinhon, Carlos
    Santos, Edcarllos
    COMPUTERS & OPERATIONS RESEARCH, 2016, 76 : 134 - 146
  • [38] Prediction-based relaxation solution approach for the fixed charge network flow problem
    Zhang, Weili
    Nicholson, Charles D.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 106 - 111
  • [39] A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem
    Yaghini, Masoud
    Karimi, Mohammad
    Rahbar, Mohadeseh
    Sharifitabar, Mohammad Hassan
    INFORMS JOURNAL ON COMPUTING, 2015, 27 (01) : 48 - 58
  • [40] Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems
    Saharidis, Georgios K. D.
    Boile, Maria
    Theofanis, Sotiris
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (06) : 6627 - 6636