.png){kind=icon}
返回
Solving a capacitated hub location problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.11.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we address a problem consisting of determining the routes and the hubs to be used in order to send, at minimum cost, a set of commodities from sources to destinations in a given capacitated network. The capacities and costs of the arcs and hubs are given, and the arcs connecting the hubs are not assumed to create a complete graph. We present a mixed integer linear programming formulation and describe two branch-and-cut algorithms based on decomposition techniques. We evaluate and compare these algorithms on instances with up to 25 commodities and 10 potential hubs. One of the contributions of this paper is to show that a Double Benders' Decomposition approach outperforms the standard Benders' Decomposition, which has been widely used in recent articles on similar problems. For larger instances we propose a heuristic approach based on a linear programming relaxation of the mixed integer model. The heuristic turns out to be very effective and the results of our computational experiments show that near-optimal solutions can be derived rapidly. (C) 2006 Elsevier B.V. All rights reserved.
Keyword:
network design
telecommunication
capacitated hub location problem
Benders decomposition
branch-and-cut algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A new fully automated gas flowmeter at the PTB for flow rates between 10-13mol/s and 10-6mol/s.png)
Metrologia
MetrologiaIF0
PREAI
分享收藏
查看更多内容