The multicommodity network flow problem: state of the art classification, applications, and solution methods

被引:40
|
作者
Salimifard, Khodakaram [1 ]
Bigharaz, Sara [2 ]
机构
[1] Persian Gulf Univ, CIIORG, Bushehr 75168, Iran
[2] Univ Torino, Dipartimento Informat, Corso Svizzera 185, I-10149 Turin, Italy
关键词
Multicommodity network flow; Literature review; Mixed-integer programming; Network optimization; VEHICLE-ROUTING PROBLEM; HAZARDOUS MATERIALS TRANSPORTATION; VARIABLE NEIGHBORHOOD SEARCH; BENDERS DECOMPOSITION METHOD; CAPACITATED LOCATION PROBLEM; DYNAMIC ENERGY MANAGEMENT; CYCLE-BASED NEIGHBORHOODS; PRICE-AND-CUT; APPROXIMATION ALGORITHMS; OPTIMIZATION PROBLEMS;
D O I
10.1007/s12351-020-00564-8
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Over the past decades, the Multicommodity Network Flow (MCNF) problem has grown popular in the academic literature and a growing number of researchers are interested in this field. It is a powerful operational research approach to tackle and solve many complicated problems, especially in transportation and telecommunication contexts. Yet, few literature reviews have made an effort to classify the existing articles accordingly. In this article, we present a taxonomic review of the MCNF literature published between 2000 and 2019. Based on an adapted version of an existing comprehensive taxonomy, we have classified 263 articles into two main categories of applications and solution methods. We have also analyzed the research interests in the MCNF literature. This classification is the first to categorize the articles into this level of detail. Results show that there are topics, which need to be addressed in future researches.
引用
收藏
页码:1 / 47
页数:47
相关论文
共 50 条
  • [31] THE MULTIPERIOD ASSIGNMENT PROBLEM - A MULTICOMMODITY NETWORK FLOW MODEL AND SPECIALIZED BRANCH AND BOUND ALGORITHM
    ARONSON, JE
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 23 (03) : 367 - 381
  • [32] Combining Tabu Search and Genetic Algorithms to Solve the Capacitated Multicommodity Network Flow Problem
    Lagos, Carolina
    Crawford, Broderick
    Cabrera, Enrique
    Soto, Ricardo
    Rubio, Jose-Miguel
    Paredes, Fernando
    STUDIES IN INFORMATICS AND CONTROL, 2014, 23 (03): : 265 - 276
  • [33] 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
  • [34] Bundle methods for sum-functions with "easy" components: applications to multicommodity network design
    Frangioni, Antonio
    Gorgone, Enrico
    MATHEMATICAL PROGRAMMING, 2014, 145 (1-2) : 133 - 161
  • [35] Model for Network Assignment Problem of Capacitated Freight with Disruptions Integer Multicommodity Flow with Recourse
    Unnikrishnan, Avinash
    Shahabi, Mehrdad
    Figliozzi, Miguel
    TRANSPORTATION RESEARCH RECORD, 2012, (2269) : 11 - 19
  • [36] Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
    Antonio Frangioni
    Enrico Gorgone
    Mathematical Programming, 2014, 145 : 133 - 161
  • [37] 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
  • [38] Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
    Khodayifar, Salman
    OPTIMIZATION LETTERS, 2021, 15 (03) : 1009 - 1026
  • [39] The vehicle routing problem: State of the art classification and review
    Braekers, Kris
    Ramaekers, Katrien
    Van Nieuwenhuyse, Inneke
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 300 - 313
  • [40] A Tabu Search Algorithm with a Probabilistic Neighbor Selection Criterion for Capacitated Multicommodity Network Flow Problem
    Cabrera, Guillermo G.
    Toledo, Carlos C.
    INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2010), 2010, : 322 - 326