基于约束的集合覆盖选址-分配问题

摘要：
在供应链协同库存背景下研究了基于集合覆盖的有时间和容量限制的配送中心选址问题，目标是系统的成本最小以及决策配送中心向需求点提供最优配送量.根据建模的假设条件，建立了基于集合覆盖的有容量和时间限制的选址 分配系统的非线性规划模型，按照模型决策空间所具有的特殊结构，设计了基于遗传和粒子群算法（GA PSO）的启发式算法.用大量的数据作为算例对模型进行了数值演算.结果表明,模型实用、算法有效.
关键词：
协同库存；选址 分配系统； 时间容量限制； 启发式算法
中图分类号： F 27
文献标志码： A

Research on the Location-Allocation System with Constraints Based on Covering Location Problem

The design of location-allocation model with time and capacity constraints was aimed to the optimal location-allocation and the lowest cost of supply chain. The non-linear programming model for location-allocation system was constructed with certain assumptions as premises. A heuristic algorithm for the model was designed according to the specific structure of the model’s decision-making space. Finally, the numerical calculation was performed in the model to solve an arithmetic problem in practical investigation. The results show that the decision model is practical and the algorithm is valid.