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 条
  • [11] Minimum-cost optimization in multicommodity logistic chain network
    Li, HX
    Tian, SC
    Pan, Y
    Zhang, X
    Yu, XC
    COMPUTER ALGEBRA AND GEOMETRIC ALGEBRA WITH APPLICATIONS, 2005, 3519 : 97 - 104
  • [12] A comparison of optimization heuristics for the data mapping problem
    Chrisochoides, N
    Mansour, N
    Fox, G
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1997, 9 (05): : 319 - 343
  • [13] Adaptive memory in multistart heuristics for multicommodity network design
    Daniel Aloise
    Celso C. Ribeiro
    Journal of Heuristics, 2011, 17 : 153 - 179
  • [14] Adaptive memory in multistart heuristics for multicommodity network design
    Aloise, Daniel
    Ribeiro, Celso C.
    JOURNAL OF HEURISTICS, 2011, 17 (02) : 153 - 179
  • [15] THE PROBLEM OF INTRACTABILITY AND ANALYSIS OF HEURISTICS IN DISCRETE OPTIMIZATION .1.
    BONDARENKO, VA
    AUTOMATION AND REMOTE CONTROL, 1992, 53 (12) : 1832 - 1836
  • [16] MULTICOMMODITY FLOW PROBLEM WITH DISCRETE CAPACITY BUNDLES
    DRIGGERS, TF
    OPERATIONS RESEARCH, 1975, 23 : B437 - B437
  • [17] Exact solution of multicommodity network optimization problems with general step cost functions
    Gabrel, V
    Knippel, A
    Minoux, M
    OPERATIONS RESEARCH LETTERS, 1999, 25 (01) : 15 - 23
  • [18] The congested multicommodity network design problem
    Paraskevopoulos, Dimitris C.
    Guerel, Sinan
    Bektas, Tolga
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 85 : 166 - 187
  • [19] Multicommodity network design with discrete node costs
    Belotti, P.
    Malucelli, F.
    Brunetta, L.
    NETWORKS, 2007, 49 (01) : 90 - 99
  • [20] THE GENERALIZED PROBLEM OF ANALYZING A MULTICOMMODITY NETWORK
    MALASHENKO, YY
    NOVIKOVA, NM
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1990, 28 (01): : 154 - 167
12345