期刊文献+

多车场车辆调度智能优化研究 被引量:12

On Intelligent Optimization of Multi-Depots Vehicle Scheduling Problem
下载PDF
导出
摘要 针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法,并且用禁忌算法优化了容量约束的多车场VSP问题.本文介绍了此智能处理方法和禁忌算法的原理,给出了具有代表性的一个算例试验结果和结果分析.试验结果表明了此方法对求解多车场容量约束的车辆调度问题的有效性. This paper presents two kinds of intelligent methods for multi-depots vehicle scheduling problem(MDVSP), and uses Tabu Search algorithm(TS) to optimize MDVSP with weight limit. This paper introduces the principium of the intelligent methods and TS. A typical result and the analysis of experiment indicate the validity of the method to solve the MDVSP with weight limit.
出处 《华东交通大学学报》 2004年第6期25-29,共5页 Journal of East China Jiaotong University
关键词 车辆调度问题 车场 智能优化 算例 原理 试验结果 智能处理 约束 容量 禁忌算法 Vehicle Scheduling Problem multi-depots tabu search weight limit
  • 相关文献

参考文献8

  • 1G. Laporte, Y. Nohert and D. Arpin. Optimal Solutions to capacitated vehicle routing problems[J]. Congressus Numerantium 44, 283 - 292 (1984).
  • 2G. Laporte, Y. Nohert and S. Taillefer, Solving a family of multi-depot vehicle routing and location- routing problems[J].Transp. Sci. 22. 161 - 172 (1988).
  • 3F. A. Tillman. The multiple terminal delivery problem with probabilistic demands[J]. Transp. Sci. 3, (1969): 192- 204
  • 4A. Wren and A. Holliday, Computer scheduling of vehicles from one or more depots to a number of delivery points[J].Opns Res. Q.23,333- 344 (1972).
  • 5B. L. Golden, T. L. Magnanti and H. Q. Nguyen. Implementing vehicle routing algorithms[J]. Networks. 7, 113-148 (1973).
  • 6I. M. Chao, B. L. Golden and E. Wasil, A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions[J]. Am, J, Math, Mgmt. Sci. 13,371- 406 (1983).
  • 7O. M. Raft, A modular algorithm for an extended vehicle scheduling problem [J]. Eur. J. Opl Res. 11, 67-76(1982).
  • 8杭省策,李怀祖.多车场车流分配的广义指派模型及其分解算法[J].西安交通大学学报,1997,31(12):111-116. 被引量:13

二级参考文献2

共引文献12

同被引文献117

引证文献12

二级引证文献72

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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