主管：中国科学院
主办：中国优选法统筹法与经济数学研究会
　　　中国科学院科技战略咨询研究院
中国管理科学

中国管理科学 ›› 2004, Vol. ›› Issue (3): 86-90.

• 论文 • 上一篇    下一篇

基于时间约束的单源/p个中转点配送系统的MINLP模型

李延晖, 马士华   

  1. 华中科技大学管理学院, 湖北, 武汉, 430074
  • 收稿日期:2003-08-30 修回日期:2004-05-16 出版日期:2004-06-28 发布日期:2012-03-07
  • 基金资助:
    国家自然科学基金重点资助项目(70332001)

An MINLP Model for the Single-Source and p-Median Distribution System Based on Time Constraints

LI Yan-hui, MA Shi-hua   

  1. School of Management, Huazhong University of Science & Technology, Wuhan 430074, China
  • Received:2003-08-30 Revised:2004-05-16 Online:2004-06-28 Published:2012-03-07

PDF (PC)

1668

摘要： 配送系统设计时,除了使系统的总费用最小外,还要满足各需求点对时间的要求。在说明了建模的假设条件后,建立了考虑时间约束的单源、p个中转点配送系统的混合整数非线性规划(MINLP)模型。根据模型的特殊结构开发了一种求解全局最优解的启发式算法,用Matlab编写了算法的计算程序,使用LINGO和Matlab软件将该算法与分枝定界法和舍入松弛法进行了比较,结果表明该启发式算法在寻求全局最优解和计算时间上都较其他两种方法更优。最后用实际调研的数据作为一个算例对模型进行了数值演算。

关键词: 时间约束, 配送系统, 混合整数非线性规划, 启发式算法, 算法比较

Abstract: Besides minimizing the total cost of the system,the design of distribution system should also meet the time requirements of the demand points.After listing the assumptions for modeling,a time-constrained mixed-integer nonlinear programming(MINLP)model of the single-source and p-median distribution system is built.According to the specific configuration,a heuristic algorithm programmed with Matlab for the model which can find the globally optimal solution is developed.Finally,a comparison among the branch and bound algorithm,rounded relaxation and the heuristic algorithm,on the software platforms of LINGO and Matlab,is presented.The result shows that the heuristic algorithm is better than the others at computing time and seeking for the globally optimal solution.At the end of this paper,a numerical example was given,in which the data were gained from the fieldwork.

Key words: time constraints, distribution system, mixed-integer nonlinear programming, heuristic algorithm, comparison of algorithms

中图分类号: