摘要
根据模型参数的类型及建模所使用的方法,将覆盖选址问题划分为确定性覆盖和概率覆盖两个大类。在确定性覆盖问题中,重点分析了集合覆盖和最大覆盖两个子类型;在概率覆盖模型中,则回顾了概率集合覆盖、最大可获得性覆盖和最大期望覆盖三种重要的概率覆盖问题。在以上划分的基础上,给出了各种覆盖选址问题典型的数学规划模型,重点分析了上述模型的假设条件及其发展的内在逻辑,并对相关的问题作了评述。
The covering facility location problem is divided into deterministic and probabilistic type covering model according to the parameter and methods used. The set covering and maximal covering location problem in the deterministic model and the probabilistic set covering, the maximal available covering and maximal expected coverage location problem in the probabilistic model are reviewed in the time order, respectively. Based on the above classification, detailed information about classic location mathematical programming models,assumptions and their development logic of each type are given and analyzed as well as review on some important issues.
出处
《物流科技》
2015年第3期59-66,共8页
Logistics Sci-Tech
基金
江苏省2014年普通高校研究生科研创新计划项目
项目编号:KYLX_0068
关键词
综述
覆盖
选址
分类
review
covering
location
classification
