A comparison of heuristics for the discrete cost multicommodity network optimization problem

被引：31
|
作者：
Gabrel, V
Knippel, A
Minoux, M
机构：
[1] Univ Paris 09, LAMSADE, F-75775 Paris 16, France
[2] Univ Paris 06, LIP6, F-75015 Paris, France
[3] Univ Paris 06, LIP6, F-75015 Paris 05, France
来源：
JOURNAL OF HEURISTICS | 2003年 / 9卷 / 05期
关键词：
multicommodity flow; heuristic; Benders decomposition;
D O I：
10.1023/B:HEUR.0000004812.23590.a2
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists of a heuristic implementation of the exact Benders-type cutting plane generation method, is proposed. All these algorithms are extensively compared on randomly generated graphs up to 50 nodes and 90 links. It clearly appears that this new Benders-type approach is very promising since it produces the best heuristic solutions.
引用
收藏
页码：429 / 445
页数：17
相关论文
共 50 条
  • [41] HEURISTICS FOR THE FIXED COST MEDIAN PROBLEM
    HOCHBAUM, DS
    MATHEMATICAL PROGRAMMING, 1982, 22 (02) : 148 - 162
  • [42] Minimum cost capacity installation for multicommodity network flows
    Dept. Indust. Eng. Operations Res., Columbia University and Bellcore, New York, NY 01127-6699, United States
    不详
    不详
    不详
    Mathematical Programming, Series B, 1998, 81 (02): : 177 - 199
  • [43] Global optimization methods for the discrete network design problem
    Wang, Shuaian
    Meng, Qiang
    Yang, Hai
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 50 : 42 - 60
  • [44] Minimum cost capacity installation for multicommodity network flows
    Daniel Bienstock
    Sunil Chopra
    Oktay Günlük
    Chih-Yang Tsai
    Mathematical Programming, 1998, 81 : 177 - 199
  • [45] Minimum cost capacity installation for multicommodity network flows
    Bienstock, D
    Chopra, S
    Gunluk, O
    Tsai, CY
    MATHEMATICAL PROGRAMMING, 1998, 81 (02) : 177 - 199
  • [46] Algorithms for discrete and continuous multicommodity flow network interdiction problems
    Lim, Churlzu
    Smith, J. Cole
    IIE TRANSACTIONS, 2007, 39 (01) : 15 - 26
  • [47] Problem Solving Heuristics, Affect, and Discrete Mathematics
    Goldin G.A.
    ZDM, 2004, 36 (2) : 56 - 60
  • [48] Multicommodity transportation and supply problem with stepwise constant cost function
    Lelkes, Z
    Rev, E
    Farkas, T
    Fonyo, Z
    Kovacs, T
    Jones, I
    European Symposium on Computer-Aided Process Engineering-15, 20A and 20B, 2005, 20a-20b : 1069 - 1074
  • [49] HEURISTIC ALGORITHMS FOR SOLVING A LARGE-SCALE MULTICOMMODITY FLOW PROBLEM ON A NETWORK WITH A STEP FUNCTION COST
    ULRICH, LY
    STUDIES IN APPLIED MATHEMATICS, 1975, 54 (03) : 207 - 227
  • [50] The Spatially Equitable Multicommodity Capacitated Network Flow Problem
    Dell'Olmo, Paolo
    Sgalambro, Antonino
    NETWORK OPTIMIZATION, 2011, 6701 : 196 - 209
12345