.png){kind=icon}
返回
On solving multi-commodity flow problems: An experimental evaluation
.png){kind=icon}
OA
AI
DOI：10.1016/j.cja.2017.05.012.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-commodity flow problems (MCFs) can be found in many areas, such as transportation, communication, and logistics. Therefore, such problems have been studied by a multitude of researchers, and a variety of methods have been proposed for solving it. However, most researchers only discuss the properties of different models and algorithms without taking into account the impacts of actual implementation. In fact, the true performance of a method may differ greatly across various implementations. In this paper, several popular optimization solvers for implementations of column generation and Lagrangian relaxation are discussed. In order to test scalability and optimality, three groups of networks with different structures are used as case studies. Results show that column generation outperforms Lagrangian relaxation in most instances, but the latter is better suited to networks with a large number of commodities. (C) 2017 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd.
Keyword:
Multi-commodity flow problem
Column generation
Lagrangian relaxation
Evaluation
Implementation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
4.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
Pretreatment serum levels of hematopoietic cytokines in patients with colorectal adenomas and cancer
PREAI
分享收藏分享收藏
查看更多内容