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

一个物流配送中心选址模型及其算法
引用本文:林珊,段复建.一个物流配送中心选址模型及其算法[J].吉首大学学报(自然科学版),2012,33(6):29-32.
作者姓名:林珊  段复建
作者单位:(桂林电子科技大学数学与计算科学学院,广西 桂林 541004)
基金项目:国家自然科学基金资助项目,广西省自然科学基金资助项目
摘    要:一个最优的配送中心选址方案,既可以提高物流系统的效率,又能降低物流系统的成本.在时间已经成为竞争优势的一种新资源的社会,将时间约束考虑到配送中心选址模型中无疑是一个突破.建立了一个物流配送中心选址模型,在模型中只需要知道所需配送中心的个数上限即可,松弛了以往模型中需确定所需配送中心个数的条件.模型求解算法上,采用优化方法中的0-1规划割平面法,结果表明模型具有可靠性,且计算复杂度得到降低.

关 键 词:配送中心选址  时间约束  0-1规划割平面法

Model of the Logistics Distribution Center Location and Its Algorithm
LIN Shan,DUAN Fu-Jian.Model of the Logistics Distribution Center Location and Its Algorithm[J].Journal of Jishou University(Natural Science Edition),2012,33(6):29-32.
Authors:LIN Shan  DUAN Fu-Jian
Institution:(School of Mathematics and Computational Science,Guilin University of Electronic Technology,Guilin 541004,Guangxi China)
Abstract:An optimal distribution center location can not only improve the efficiency of the logistic system,but also reduce the cost of logistics system as well.In the current society,time has become a new resource of competitive advantage,so taking into account the time constraints on the distribution center location model is undoubtedly a breakthrough.A model of the logistics distribution center location is proposed.In the new model it is necessary  to know the upper limit of the number of the required distribution center,thus the  relaxation of the conditions to be determined in the previous model is achieved.Finally 0-1 programming cutting plane method,which is the optimization methods,is used for model solution.At last the results indicate that the model is reliable,and the methods reduce the computational complexity of the algorithm.
Keywords:distribution center location time constraints  O-1 programming cutting plane method
本文献已被 万方数据 等数据库收录!
点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《吉首大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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