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

上海交通大学学报（自然版） ›› 2013, Vol. 47 ›› Issue (03): 495-499.

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

毕娅1, 李文锋2

(1.湖北经济学院物流与工程管理学院, 武汉 430205; 2.武汉理工大学物流工程学院, 武汉 430063)

收稿日期:2012-03-12 出版日期:2013-03-28 发布日期:2013-03-28
基金资助:
湖北省自然科学基金重点项目（2010CDA022），湖北物流发展研究中心项目（2011A03）

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

BI Ya-1, LI Wen-Feng-2

(1.School of Logistics and Engineering Management, Hubei University of Economics, Wuhan 430205， China; 2.School of Logistics Engineering, Wuhan University of Technology, Wuhan 430063, China)

Received:2012-03-12 Online:2013-03-28 Published:2013-03-28

摘要/Abstract

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

Abstract: 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.

Key words: collaborative inventory, locationallocation system, time and capacity constraints, heuristic algorithm

毕娅1, 李文锋2. 基于约束的集合覆盖选址-分配问题[J]. 上海交通大学学报（自然版）, 2013, 47(03): 495-499.

BI Ya-1, LI Wen-Feng-2. Research on the Location-Allocation System with Constraints Based on Covering Location Problem[J]. Journal of Shanghai Jiaotong University, 2013, 47(03): 495-499.

参考文献

［1］Goldengorin B, Ghosh D, Siekrsma G. Branch and peg algorihthms for the simple plant location problem［J］. Computers & Operations Research, 2003,30（5）：967981.
［2］Harkness J,ReVelle C. Facility location with increasing production costs［J］. European Journal of Operational Research,2003，145(10)：113.
［3］王文峰,刘新亮,郭波. 综合多准则决策的保障设施选址分派方法［J］.系统工程理论与实践,2008,14（21）：148153.
WANG Wenfeng, LIU Xinliang, GUO Bo. Research on the multicriteria integrated military support facility locationallocation method［J］. Systems Engineeringtheory & Practice, 2008,14（21）：148153.
［4］汤希峰,毛海军,李旭宏.物流配送中心选址的多目标优化模型［J］.东南大学学报,2009,39(2)：404407.
TANG Xifeng, MAO Haijun, LI Xuhong. Multiobjective optimization model of locations for distribution centers ［J］. Journal of Southeast University， 2009, 39(2)：404407.
［5］黄松,杨超.随机需求下联合选址库存模型研究［J］.中国管理科学,2009,17(5): 96102.
HUANG Song, YANG Chao. Study on joint locationinventory model under stochastic demand ［J］. Chinese Journal of Management Science, 2009,17(5):96102.
［6］孙浩,达庆利.制造/再制造集成物流网络设施选址问题研究［J］.计算机集成制造统,2009,15(9): 362368.
SUN Hao, DA Qingli. Facilitylocation problem for an integrated manufacturing/remanufacturing logistics network ［J］. Computer Integrated Manufacturing Systems, 2009,15(9):362368.
［7］郭子雪,齐美然,张强.基于区间数的应急物资储备库最小费用选址模型［J］.运筹与管理,

2010,19(1): 1520.
GUO Zixue, QI Meiran, ZHANG Qiang. Minimum cost model of emergency material storage location based on interval number ［J］. Operations Research and Management Science, 2010,19(1):1520.
［8］税文兵,叶怀珍,张诗波.物流配送中心动态选址模型及算法研究［J］.计算机应用研究,2010,27(12):44764480.
SHUI Wenbing, YE Huaizhen, ZHANG Shibo. Research on dynamic location model and algorithm of logistics distribution centers ［J］. Application Research of Computers, 2010,27(12):44764480.
［9］管小俊,王喜富,王翠华,等.基于竞争的物流中心选址双层规划模型及算法研究［J］.武汉理工大学学报,2009,33(5): 956959.
GUAN Xiaojun, WAND Xifu, WANG Cuihua, et al. Study on logistics center location bilevel programming model and algorithm based on competition ［J］. Journal of Wuhan University of Technology, 2009,33(5): 956959.