首页 | 本学科首页   官方微博 | 高级检索  
     检索      

贪婪取走启发式算法在离散网络选址中的研究
引用本文:关怀庆,张毕西,欧江艳.贪婪取走启发式算法在离散网络选址中的研究[J].系统科学学报,2010,18(3):49-52,56.
作者姓名:关怀庆  张毕西  欧江艳
作者单位:广东工业大学管理学院,广东广州510520
基金项目:国家自然科学基金项目(中小型制造企业人机工序混合系统组织计划与控制研究 批准号:70671030); 广东省普通高校人文社科重点研究基地重大项目:(中小制造企业生产系统组织、控制与优化研究08jdxm63004)
摘    要:物流配送中心的选址决策在物流运作中有着重要的地位。介绍了一种离散型网络选址模型-P-中值模型及其一般迭代解法即贪婪取走启发式算法,并提出一种基于改进的P-中值选址模型,使得该模型更客观,科学和实用。通过实例分析说明该模型在物流配送中心选址中的有效性,为实际的选址决策提供理论参考。

关 键 词:启发式算法  网络选址  选址模型

The Study of Greedy Dropping Heuristic Algorithm in Discrete Network Location
GUAN Huai-qing,ZHANG Bi-xi,OU Jiang-yan.The Study of Greedy Dropping Heuristic Algorithm in Discrete Network Location[J].Journal of Systems Science,2010,18(3):49-52,56.
Authors:GUAN Huai-qing  ZHANG Bi-xi  OU Jiang-yan
Institution:(School of Management, Guangdong University of Technology, Guangzhou 510520,China)
Abstract:The strategy of distribution center site selection take an important part in the logistics operation. This paper introduce a discrete network location model as P-median model and its general iterative method which is Greedy Dropping Heuristic Algorithm, and develops an improved P-median model, which made the model more objective, scientific and more practical. And a simple case is employed to shows the effectiveness of selection in the logistics distribution center location and provide theory references in the decision of real location selection.
Keywords:Greedy Dropping Heuristic Algorithm  Network location  Location model
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号