期刊文献+

物流调度问题的优化方法评述

The Research Review on Optimal Algorithms of Logistic Scheduling Problem
在线阅读 下载PDF
导出
摘要 随着电子商务的发展,物流调度逐渐成为现代物流的关键环节,该环节处理的好坏直接影响到对客户需求的响应速度,客户对物流环节的满意度以及服务商的配送成本。物流调度问题是一个NP难题,在对物流调度问题进行直观描述的基础上建立数学模型,对求解这一问题的方法进行评述,提出了物流调度问题及软计算理论的进一步研究方向。 With the development of economy and commercial business, logistic distribution has become one of the most important parts of modern logistics. The efficiency of logistic distribution directly influences the response speed of customer demand, customer satisfaction and distribution costs of the service providers. Logistic scheduling problem is an NP - hard problem. By describing the logistics scheduling problem objectively, the model of the problem is built in this , paper. The algorithms of exact algorithm, heuristic algorithms and soft computing are used to solve the problem by overcoming their shortcomings, especially for soft computing. It points out the future trend in the researches on logistic scheduling problem and soft computing.
出处 《商业研究》 CSSCI 北大核心 2009年第5期107-111,共5页 Commercial Research
基金 黑龙江省博士后基金 项目编号:LBH-Z05129 黑龙江省科技攻关项目 项目编号:GB06D102-2
关键词 物流调度问题 软计算 模糊逻辑 遗传算法 logistic scheduling problem soft computing fuzzy logic genetic algorithm
  • 相关文献

参考文献41

  • 1Dantzig G, Ramser J. The truck dispatching problem [ J ]. Management science, 1959 (6) :80 - 91.
  • 2Psaraftis HN. Dynamic vehicle routing: status and prospects. Annals of Operations Research, 1995 (61) :143 - 164.
  • 3Jean- Yves Potvin, Ying Xu, Ilham Benyahia. Vehicle routing and scheduling with dynamic travel times [ J ]. Computers&Operations Research, 2006 (33) :1129 -1137.
  • 4郭耀煌,李军.车辆优化调度问题的研究现状评述[J].西南交通大学学报,1995,30(4):376-382. 被引量:51
  • 5Paolo T, Daniele V. Models, relaxations and exact approaches for the capacitated vehicle routing problem [ J ]. Discrete Applicated Mathematics, 2002 (123) :487 -512.
  • 6Padberg M, Rinaldi G. A branch -and- cut algorithm for the resolution of large - scale symmetric traveling salesman problems [ J ]. SIAM Review, 1991,33(1) :60-100.
  • 7Fisher M L. Optimal solution of vehicle routing problems using minimum k - trees [ J ]. Operations Research, 1994, 42 (4) :141 -153.
  • 8Kohl N, Madsen O B G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation [ J ]. Operations Research, 1997,45 (3) :395 -406.
  • 9Gillett B E, Miller L R. A heuristic algorithm for the vehicle - dispatch problem [ J ]. Operations Research, 1974, 22(2) :240 -349.
  • 10Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points [ J ]. Operations Research, 1964, 12(4):568-581.

二级参考文献76

共引文献121

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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