期刊文献+

单周期离散随机需求的库存-运输整合优化 被引量:15

Optimization on ITIO of Single-cycle Discrete and Stochastic Demand
下载PDF
导出
摘要 库存-运输整合优化问题极为复杂,目前尚缺乏系统研究。本文针对一个配送中心与多个客户组成的配送系统,讨论客户单周期离散随机需求条件下,建立该系统的库存-运输整合优化问题模型。并通过分析模型的离散特征,把问题转化为一般的车辆路径问题,借鉴现有的求解方法,构造了求解模型的自适应单亲遗传算法。最后用MATLAB编程并用测例进行了测试。结果表明,借助现代优化方法,库存-运输整合问题的研究具有理论意义和实际价值。 Inventory-Transportation Integrated Optimization (ITIO) is extremely complex, and the researches on its problems are rare. In this paper, a distribution system which consists of one distribution center and multiple customers is discused. On the assumption that every customer has its discrete stochastic single-cycle demand, a model for the ITIO is proposed and transformed into a general vehicle routing problem. With the aids of the existing solution methods, an adaptive Partheno-Genetic Algorithm is designed for the model. The algorithm was programmed in MATLAB, and tested with a benchmark problem. The result shows that the ITIO has its theoretical and practical value.
作者 傅成红 符卓
出处 《系统工程》 CSCD 北大核心 2007年第1期9-12,共4页 Systems Engineering
基金 国家自然科学基金资助项目(70671108)
关键词 物流与供应链 车辆路径问题 遗传算法 库存 运输 Logistics and Supply Chain Vehicle Routing Problem Transportation Inventory Genetic Algorithms
  • 相关文献

参考文献11

二级参考文献53

  • 1姜大立,叶怀珍.企业运输计划研究[J].西南交通大学学报,1996,31(6):671-674. 被引量:6
  • 2日通综合研究所.物流手册[M].北京:物资出版社,1986..
  • 3袁庆达.随机库存-运输联合优化问题研究,博士学位论文[M].,..
  • 4[1]Dantzig G, Ramser J. The truck dispatching problem[J]. Management Sci,1959,6:80-91.
  • 5[2]Fischetti Matteo. A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs[J]. Operations Research,1994,42(5):846-849.
  • 6[3]Vigo Daniele. A heuristic for the asymmetric capacitated vehicle routing problem[J]. European Journal of Operational Research,1996,89:108-126.
  • 7[4]Gendreau Michel. A tabu search heuristic for the vehicle routing problem[J]. Management Sci,1994,40(10):1276-1290.
  • 8[5]Attahiru Sule Alfa. A 3-opt based simulated annealing algorithm for vehicle routing porblems[J]. Computers Ind Engng,1991,21(1-4):635-639.
  • 9[6]Marshall L Fisher. Optimal solution of vehicle routing problems using minimum K-trees[J]. Operations Research,1994,42(4):626-642.
  • 10[7]Glover Fred. Tabu search-partⅠ[J]. ORSA Journal on Computing,1989,1(3):190-205.

共引文献129

同被引文献207

引证文献15

二级引证文献53

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部