期刊文献+

带装载能力约束的开放式车辆路径问题及其禁忌搜索算法研究 被引量:62

The Capacitated Open Vehicle Routing Problem and Its Tabu Search Algorithm
原文传递
导出
摘要 对另一种类型的车辆路径问题——开放式车辆路径问题进行了研究 .提出了一种用于求解带装载能力约束的开放式车辆路径问题的禁忌搜索算法 .给出了算法对测试算例的运算结果 ,并与文献中目前最好的结果进行比较 .比较结果表明 ,在绝大多数情况下 ,该算法能求出更好的解 . In this paper another kind of the vehicle routing problem - the open vehicle routing problem is studied. A tabu search algorithm for the capacitated open vehicle routing problem is proposed. The computational results are provided and compared with the best ones so far in the literature. It shows that in most of cases this algorithm can find better solutions.
作者 符卓
出处 《系统工程理论与实践》 EI CSCD 北大核心 2004年第3期123-128,共6页 Systems Engineering-Theory & Practice
基金 国家自然科学基金 (70 0 71 0 0 3 )
关键词 开放式车辆路径问题 禁忌搜索算法 启发式算法 OVRP 车辆路径问题 vehicle routing open vehicle routing problem tabu search distribution management
  • 相关文献

参考文献19

  • 1[1]Schrage L. Formulation and structure of more complex/realistic routing and scheduling problems[J]. Networks, 1981,11: 229-232.
  • 2[2]Sariklis D and Powell S. A heuristic method for the open vehicle routing problem[J]. Journal of the Operational Research Society, 2000,51: 564-573.
  • 3[3]Fu Z.and Wright M. Train plan model for British rail freight services through the channel tunnel[J]. Journal of the Operational Research Society, 1994,45(4):384-391.
  • 4[4]Dulac G, Ferland JA and Forgues PA. School bus routes generator in urbansurroundings[J]. Computers and Operations Research, 1980,7:199-213.
  • 5[5]Braca J, Bramel J, Posner B and Simchi-levi D. A computerized approach to the New York city school bus routing problem[J]. IIE Transactions, 1997,29:693-702.
  • 6[6]Li LYO and Fu Z. The school bus routing problem: a case study[J]. Journal of the Operational Research Society, 2002,53(5):552-558.
  • 7[7]Syslo MM, Deo N and Kowalik JS. Discrete Optimization Algorithms with Pascal Programs[M]. New Jersey: Prentice-Hall, Inc, 1983. 381-382.
  • 8[8]Brand(a~o) J. The open vehicle routing problem[R]. Presented in EURO 2001, Rotterdam, The Netherlands. 2001.
  • 9[9]Cripim J and Brand(a~o) J. Reactive tabu search and variable neighbourhood descent applied to the open vehicle routing problem[R]. Presented in Optimization 2001, Aveiro, Portugal. 2001.
  • 10[10]Fu Z and Eglese R. Train planning and timetabling - a kind of open vehicle routing problem with soft time windows[R]. Presented in IFORS 2002, Edinburgh, UK. 2002.

同被引文献607

引证文献62

二级引证文献537

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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