Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
复制标题
DOI：
10.1016/0377-2217(83)90179-0
复制
发表时间：
1983
影响因子：
6.4
通讯作者：
Nicos Christofides;J. Beasley
中科院分区：
文献类型：
--
作者：
Nicos Christofides;J. Beasley
在本文中，我们提出了一个下界的有能力的仓库选址问题的基础上的拉格朗日松弛的混合整数公式的问题，其中我们使用次梯度优化，试图最大化这个下界。给出了基于该下界和原问题的问题约简检验。将此约束和约简测试合并到树搜索过程中，使我们能够解决涉及多达50个仓库和150个客户的问题。
In this paper we present a lower bound for the capacitated warehouse location problem based upon the Lagrangean relaxation of a mixed-integer formulation of the problem, where we use subgradient optimisation in an attempt to maximise this lower bound. Problem reduction tests based upon this lower bound and the original problem are given. Incorporating this bound and the reduction tests into a tree search procedure enables us to solve problems involving up to 50 warehouses and 150 customers.