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 条
  • [1] A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem
    Virginie Gabrel
    Arnaud Knippel
    Michel Minoux
    Journal of Heuristics, 2003, 9 : 429 - 445
  • [2] Optimal solution of the discrete cost multicommodity network design problem
    Mrad, Mehdi
    Haouari, Mohamed
    APPLIED MATHEMATICS AND COMPUTATION, 2008, 204 (02) : 745 - 753
  • [3] Compact MILP models for the Discrete Cost Multicommodity Network Design Problem
    Layeb, Safa Bhar
    Heni, Riheb
    Balma, Ali
    2017 INTERNATIONAL CONFERENCE ON ENGINEERING & MIS (ICEMIS), 2017,
  • [4] On lower bounds computation for the Discrete Cost Multicommodity Network Design Problem
    Ennaifer, Nesrine Bakkar
    Layeb, Safa Bhar
    Zeghal, Farah Mansour
    2016 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2016, : 511 - 516
  • [5] Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
    Michel Minoux
    Annals of Operations Research, 2001, 106 : 19 - 46
  • [6] Discrete cost multicommodity network optimization problems and exact solution methods
    Minoux, M
    ANNALS OF OPERATIONS RESEARCH, 2001, 106 (1-4) : 19 - 46
  • [7] An exact approach for the multicommodity network optimization problem with a step cost function
    Mejri, Imen
    Haouari, Mohamed
    Layeb, Safa Bhar
    Mansour, Farah Zeghal
    RAIRO-OPERATIONS RESEARCH, 2019, 53 (04) : 1279 - 1295
  • [8] A simulation-optimization approach for the stochastic discrete cost multicommodity flow problem
    Mejri, Imen
    Layeb, Safa Bhar
    Haouari, Mohamed
    Mansour, Farah Zeghal
    ENGINEERING OPTIMIZATION, 2020, 52 (03) : 507 - 526
  • [9] Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
    Holmberg, Kai
    Joborn, Martin
    Melin, Kennet
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 188 (01) : 101 - 108
  • [10] Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications
    Mladenovic, Snezana
    Stefanovic, Ivana
    Jankovic, Sladana
    Uzelac, Ana
    Markovic, Goran
    Zdravkovic, Stefan
    PROMET-TRAFFIC & TRANSPORTATION, 2024, 36 (04): : 608 - 622
12345