返回
A first multilevel cooperative algorithm for capacitated multicommodity network design
DOI:10.1016/j.cor.2005.07.015.png)
摘要
En 中文
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.
Keyword:
parallel search
multilevel cooperation
cycle-based tabu search
capacitated multicommodity network design
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design路径重新链接,基于周期的邻域和容量的多商品网络设计
PqsA is required for the biosynthesis of 2,4-dihydroxyquinoline (DHQ), a newly identified metabolite produced by Pseudomonas aeruginosa and Burkholderia thailandensis
bchm
IF0

