期刊文献+

基于Dijkstra拓展算法路线优化 被引量:3

Dijkstra based algorithm for vehicle scheduling and route optimizatio
下载PDF
导出
摘要 利用Dijkstra算法,将配送中心的3个业务目标(距离、时间和费用)进行整合,建立可实现多目标的模型。对多目标Dijkstra算法进行了拓展,即一个配送中心对应两个客户配送以及车辆调度。 With Dijkstra algorithm, the three business indexes in a distribution center such as distance, time and cost are integrated to build the multi-objective model. The multi-objective Dijkstra algorithm is extended with which one distribution center is responsible for two customer distribution business and vehicle scheduling.
出处 《长春工业大学学报》 CAS 2015年第1期66-71,共6页 Journal of Changchun University of Technology
基金 2013年高校省级优秀青年人才基金重点项目(2013SQRW108ZD)
关键词 配送中心 多目标 车辆调度 路线优化 distribution center multi-objective algorithm vehicle scheduling route optimization.
  • 相关文献

参考文献6

二级参考文献47

  • 1Kung R M, Hanson E N, Ioannidis Y E, et al. Heuristic search in database systems[C]//Proceedings from the First International Workshop on Expert Database Systems, Kiawah Island, South Carolina, United States, 1986: 537 -548.
  • 2Russell S, Norvig P. Artificial Intelligence: A Modern Approach[M]. 2nd ed. Prentice-Hall: Englewood Cliffs, N J, 2003.
  • 3Nachtigall K. Time depending shortest-path problems with applications to railway networks[J]. European Journal of Operational Research, 1995, 83: 154-166.
  • 4Sung K, Bell M, Seong M, et al. Shortest paths in a network with time-dependent flow speeds[J]. European Journal of Operational Research, 2000, 121(1): 32-39.
  • 5Xu M H, Liu Y Q, et al. An improved Dijkstra's shortest path algorithm for sparse network[J]. Applied Mathe- matics and Computation, 2007, 185(1): 247-254.
  • 6Ziliaskopoulos A K, Mahmassani H S. A time-dependent shortest path algorithm for real-time intelligent vehi- cle/highway systems[J]. Transportation Research Record, 1993, 1408: 94-104.
  • 7Haldar S. An 'all pairs shortest paths' distributed algorithm using 2n^2 messages[J]. Journal of Algorithms, 1997, 24:20 -36.
  • 8Fredman M L, Tarjan R E. Fibonacci heaps and their uses in improved network optimization algorithm[J]. Journal of the ACM, 1987, 34(3): 596-615.
  • 9Han Y. Improved algorithm for all pairs shortest paths[J]. Inform Process Lett, 2004, 91: 245-250.
  • 10Fukuyama Y.Fundamentals of particle swarm techniques [A].Lee K Y,El-Sharkawi M A.Modern Heuristic Optimization Techniques With Applications to Power Systems [M].IEEE Power Engineering Society,2002.45~51

共引文献413

同被引文献7

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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