arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.05252math.OCcs.DM
收藏

正在升级树形集线器位置中的节点

Upgrading nodes in tree-shaped hub location

Víctor Blanco, Alfredo Marín

摘要:

在本文中,我们介绍了枢纽树定位问题升级,混合的枢纽树定位问题,提出了Contreras等。al(2010),以及Krumke(1999)首次研究的具有升级节点的最小成本生成树问题。除了定位集线器、确定连接集线器的树以及将非集线器节点分配给集线器之外,还必须考虑到给定的升级节点的总数,来做出关于哪个集线器将被升级的决策。我们提出了两种不同的混合规划线性规划配方的问题,收紧配方,并产生几个家庭的有效不等式。一个计算研究显示的改进与加强的配方,并比较它们。

英文摘要:

In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al (2010), and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time by Krumke (1999). In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made about which of the hubs will be upgraded, taking into account that the total number of upgraded nodes is given. We present two different Mixed Integer Linear Programming formulations for the problem, tighten the formulations and generate several families of valid inequalities for them. A computational study is presented showing the improvements attained with the strengthening of the formulations and comparing them.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑