解决约束多设备韦伯问题的一种启发式算法

提出解决约束多设备韦伯问题的启发式算法属于一种定位和分配交替算法.约束多设备韦伯问题包含了常见的不带约束的多设备韦伯问题作为它的特殊情况.在分配阶段,采取最近中心再分组方法;在定位过程中,将非光滑约束韦伯问题转化为优化问题,再将之化为单调线性变分不等式,进而通过投影—收缩方法;在文章的最后给出了几组实例的数据计算结果.

A heuristic algorithm for constrained multi- source Weber problem

In this paper a heuristic algorithm,which belongs to an alternate location and allocation(algorithm),is proposed to solve constrained multi-source Weber problem(CMWP) with multi-source(Weber) problem(MWP) as a special form.During the allocation phase,the heuristic of nearest center(reclassification)(NCR) is adopted.And during the location phase,a method is introduced which can turn the nonsmooth constrained Weber problem(CWP) to a smooth optimization problem.A monotone linear variational inequality(LVI) is acquired from the smooth problem and it may be solved by a projection-contraction(PC) method.At the end of the paper several tests numerical results are reported.