A first multilevel cooperative algorithm for capacitated multicommodity network design

被引：44

作者：

Crainic, TG ^{[1
]}

Li, Y

Toulouse, M

机构：

[1] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3T 1J4, Canada

[2] Univ Quebec, Ecole Sci Gest, Dept Management & Technol, Montreal, PQ H3C 3P8, Canada

[3] Univ Manitoba, Dept Comp Sci, Winnipeg, MB R3T 2N2, Canada

来源：

COMPUTERS & OPERATIONS RESEARCH | 2006年 / 33卷 / 09期

基金：

加拿大自然科学与工程研究理事会;

关键词：

parallel search; multilevel cooperation; cycle-based tabu search; capacitated multicommodity network design;

D O I：

10.1016/j.cor.2005.07.015

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We describe the first multilevel cooperative tabu search for the capacitated multicommodity network design problem. Main design challenges are associated to the specification of the problem instance addressed at each level in cooperation, as well as to the definition of the cooperation operators. The paper proposes a first approach to address these challenges and tests it on a set of well-known benchmark problems. The proposed method appears competitive, particularly when difficult problems with many commodities are considered. Directions and challenges for future research are identified and discussed. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：2602 / 2622

页数：21

共 50 条

[1] Solving multicommodity capacitated network design problems using a multiobjective evolutionary algorithm
Kleeman, Mark P.
Lamont, Gary B.
Hopkinson, Kenneth M.
Graham, Scott R.
[J]. 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SECURITY AND DEFENSE APPLICATIONS, 2007, : 33 - +
[2] Tabu search-based algorithm for capacitated multicommodity network design problem
Zaleta, NC
Socarrás, AMA
[J]. 14TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS, AND COMPUTERS, PROCEEDINGS, 2004, : 144 - 148
[3] Design-balanced capacitated multicommodity network design with heterogeneous assets
Li, Xiangyong
Wei, Kai
Aneja, Y. P.
Tian, Peng
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2017, 67 : 145 - 159
[4] Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson M.
Cordeau, Jean-Francois
Gendron, Bernard
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2009, 42 (03) : 371 - 392
[5] The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Chouman, Mervat
Crainic, Teodor Gabriel
Gendron, Bernard
[J]. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2018, 6 (02) : 143 - 184
[6] Benders, metric and cutset inequalities for multicommodity capacitated network design
Alysson M. Costa
Jean-François Cordeau
Bernard Gendron
[J]. Computational Optimization and Applications, 2009, 42 : 371 - 392
[7] A capacity scaling heuristic for the multicommodity capacitated network design problem
Katayama, N.
Chen, M.
Kubo, M.
[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 232 (01) : 90 - 101
[8] A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design
Yaghini, Masoud
Momeni, Mohsen
Sarmadi, Mohammadreza
[J]. APPLIED SOFT COMPUTING, 2012, 12 (09) : 2997 - 3003
[9] A combined fast greedy heuristic for the capacitated multicommodity network design problem
Katayama, Naoto
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (11) : 1983 - 1996
[10] 0-1 reformulations of the multicommodity capacitated network design problem
Frangioni, Antonio
Gendron, Bernard
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (06) : 1229 - 1241

← 1 2 3 4 5 →