吉首大学学报(自然科学版) ›› 2012, Vol. 33 ›› Issue (6): 29-32.DOI: 10.3969/j.issn.1007-2985.2012.06.008

• 数学 • 上一篇    下一篇

一个物流配送中心选址模型及其算法

  

  1. (桂林电子科技大学数学与计算科学学院,广西 桂林 541004)
  • 出版日期:2012-11-25 发布日期:2013-01-14
  • 作者简介:林珊(1988- ),女,广西贵港人,硕士研究生,主要从事最优化理论与方法研究;段复建(1965- ),男,黑龙江黑河人,桂林电子科技大学数学与计算科学学院教授,博士,主要从事最优化理论与方法、组合优化研究.
  • 基金资助:

    国家自然科学基金资助项目(11061011);广西壮族自治区自然科学基金资助项目(2011GXNSFA018138)

Model of the Logistics Distribution Center Location and Its Algorithm

  1. (School of Mathematics and Computational Science,Guilin University of Electronic Technology,Guilin 541004,Guangxi China)
  • Online:2012-11-25 Published:2013-01-14

摘要:一个最优的配送中心选址方案,既可以提高物流系统的效率,又能降低物流系统的成本.在时间已经成为竞争优势的一种新资源的社会,将时间约束考虑到配送中心选址模型中无疑是一个突破.建立了一个物流配送中心选址模型,在模型中只需要知道所需配送中心的个数上限即可,松弛了以往模型中需确定所需配送中心个数的条件.模型求解算法上,采用优化方法中的0-1规划割平面法,结果表明模型具有可靠性,且计算复杂度得到降低.

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

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.

Key words: distribution center location, time constraints, 0-1 programming cutting plane method

公众号 电子书橱 超星期刊 手机浏览 在线QQ