期刊文献+

利用TransCAD软件包解决基于时间窗的车辆路径问题 被引量:4

Application of TransCAD Software Package to Solving Vehicle Routing Problem with TimeWindows
下载PDF
导出
摘要 在简述交通软件TransCAD功能的基础上,结合车辆路径优化的特点,在考虑时间窗约束、容量约束等因素的条件下,给出了一种基于时间窗的求解车辆路径问题的数学模型,阐述了TransCAD软件包及其在求解车辆路径优化问题上的应用,并给出了实例。 Based on the introduction of TransCAD, vehicle routing optimization, and time windows constraints and capacity constraints, a mathematical model based on vehicle routing problem with time windows was presented. The TransCAD software package and its application to solving vehicle routing problem with time windows were illustrated, The examples of vehicle routing problem with time windows were also given.
出处 《交通与计算机》 2007年第1期113-114,118,共3页 Computer and Communications
关键词 数学建模 软件 物流中心 车辆路径 组合优化 时间窗约束 mathematical modeling software logistic center vehicle routing combination optimization time windows constraints
  • 相关文献

参考文献4

  • 1Malmborg,Charles.Genetic algorithm for service level based vehicle scheduling.European journal of operational research,1996,93 (1):121-134
  • 2刘小兰,郝志峰,汪国强,符克强.有时间窗的车辆路径问题的近似算法研究[J].计算机集成制造系统,2004,10(7):825-831. 被引量:21
  • 3Savelsbergh M.Local search for routing problem with time windows.Annals of Operations Research,1985,16(4):285-305
  • 4Caliper Corporation.TransCAD transportation GIS software (routing and logistics with transCAD 4.8).America:Caliper Corporation,2006:9-33

二级参考文献9

  • 1DANTZIG G, RAMSER J. The truck dispatching problem [J]. Management Science, 1959, 10(6):80-91.
  • 2SAVELSBERG M W P. Local search for routing problem with time windows[J]. Ann. of Operations Research, 1985, 16(4) :285-305.
  • 3SHAW P. Using constraint programming and local search methods to solve vehicle routing problems[A]. Principles of the Fourth International Conference on Principles and Practice of Constraint Programming[C]. 1998. 417-431.
  • 4LARSEN J. Parallelization of the vehicle routing problem with time windows[D]. Denmark: Technical University of Denmark, 1999.
  • 5CLARKE G, WRIGHT J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research ,1964, 12:568-581.
  • 6BENT R,HENTENRYCK Van P. A two-stage hybrid local search for the vehicle routing problem with time windows[R]. U S A:Brown University, 2001.
  • 7HARVEY W D, GINSBERG M L. Limited discrepancy search[A]. Proceedings of the 14th International Joint Conference on Artificial Intelligence[C]. 1995.
  • 8李帮义,姚恩瑜.约束最小支撑树(C-MST)问题:复杂性和上下界估计[J].浙江大学学报(理学版),2000,27(3):237-242. 被引量:1
  • 9张丽萍,柴跃廷,曹瑞.有时间窗车辆路径问题的改进遗传算法[J].计算机集成制造系统-CIMS,2002,8(6):451-454. 被引量:54

共引文献20

同被引文献19

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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