带覆盖需求约束的设施选址问题

Facility Location Problem with Coverings Demands Limitation

带覆盖需求约束的设施选址问题(FLPWCDL)研究:客户必须在规定的响应半径内被服务,并要求服务站能够覆盖规定的需求数量,如何选择合适的服务站,使总成本(建站成本+路线成本)最小.FLPWCDL广泛应用于应急服务、物流、便利店等服务站的选址.建立了问题的混合整数规划模型,并构造了求解FLPWCDL的Benders分解算法,计算实验显示Benders分解算法具有非常高的求解效率与求解质量.

We consider the facility location problem with covering demands limitation（FLPW CDL）. Requiring all the clients could be serviced by facilities in given radii and the facilities nmst cover enough demands, what is the optimal way to locate facilities such that the total cost （opening costs plus routing costs） is minimized？ FLPWCDL has a wide range of applications within emergency services, logistics as well as convenient stores. This paper constructs a mixed 0-1 integer programming model for FLPWCDL. Then We provided a heuristic algorithm based on benders decomposition which is very effective on solving FLP- WCDL.