On solving multi-commodity flow problems: An experimental evaluation |
| |
| Authors: | Weibin DAI Jun ZHANG Xiaoqian SUN |
| |
| Institution: | 1. School of Electronic and Information Engineering, Beihang University, Beijing 100083, China;2. National Key Laboratory of CNS/A TM, Beijing 100083, China;3. Beijing Key Laboratory for Network-based Cooperative A TM, Beijing 100083, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Multi-commodity flow problem Column generation Lagrangian relaxation Evaluation Implementation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
