期刊文献+

大规模客户集实时优化配送研究

Research on Optimizing Distribution Routing of Large-scale Client
下载PDF
导出
摘要 大规模客户集的实时优化研究具有很强的应用价值,但在具体的应用中存在很多问题,文章在借鉴前人研究的基础上设计出了具有动态组中心的最远临近分组算法和改进的禁忌搜索算法,并提出利用GPS导航仪辅助配送的方法来实现对客户的寻找的方法,实现了大规模客户集实时优化的实际应用。 The research on optimizing distribution routing of large-scale client hasa large value on application, but now it exists a lot of problem in the process of application, The paper design a method of grouping names farthest-nearest neighbor algorithm with a variational center and a improved Taboo Search in term of the research of other people, more- over, the paper design a distribution way that use a navigator to help deliveryman to find the clients.
出处 《物流科技》 2009年第6期17-18,共2页 Logistics Sci-Tech
关键词 最远临近分组 改进的禁忌搜索算法 GPS导航仪 farthest-nearest neighbor algorithm improvedtaboo search algorithm GPS-navigator
  • 相关文献

参考文献4

  • 1B.E.Gillet, L.R.Miller. A heuristic algorithm for the vehicle dispatch problem[J]. Operations Research, 1974,22:340-349.
  • 2M.L.Fisher, R Jaikumar. A generalized assignment heuristic for vehicle routing[J]. Networks, 1981,11:109-124.
  • 3D.M.Ryan, C.Hjorring and FGlover. Extensions of the petal method for vehicle routing[J]. Journal of the Operational Research Society, 1993,44:289-296.
  • 4E.D.Taillard. Paralel iterative search methods for vehicle routing problems[J]. Networks, 1993,23:1-6.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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