期刊文献+

一种基于路网数据的LRP并行求解算法 被引量:3

A Parallel Algorithm for Location-Routing Problem Based on Road Network Data
下载PDF
导出
摘要 选址-配送问题(LRP)涉及配送中心选址与配送路径选择,是现代物流系统的核心问题,也是复杂度高的NP-hard问题。该文针对路网数据的稳定性,使用GIS网络分析算法对路网数据进行预处理,并完成静态的配送中心选址,对于动态变化的配送任务,使用并行遗传算法(pGA)解决LRP问题。实验证明该算法处理中等规模的配送任务可以将时间控制在数秒,大大提升了物流配送系统的实用性和时效性。 Logistics plays an important role in morden companies, especially in the fast developing E-commerce industry. Under this backgroud, in the past few decades there sprung up a lot of research and practical explorations. In order to achieve the practical use of the logistics systems, considering the geospatial dependence of logistics, this article brings real road network data in- to logistics system, tries to combine classical Geographic Information System (GIS) network analysis algorithms and Genetic Algorithm(GA) to solve the Location-Routing Problem(LRP), which is the key problem in logistics. This article mainly ex- plains the pretreat process of the road network data with GIS network analysis algorithms and the method to solve the LRP with parallel Genetic Algorithm (pGA). The experiments show that the method mentioned above greatly improved the practicality of the logisties system, the efficiency and accuracy of the system can both be improved by parallel computing.
出处 《地理与地理信息科学》 CSCD 北大核心 2013年第4期13-16,34,F0002,共6页 Geography and Geo-Information Science
基金 国家863计划项目子课题(2011AA120302)
关键词 选址-配送问题(LRP) 并行遗传算法(pGA) GIS网络分析算法 Location-Routing Problem(LRP) parallel Genetic Algorithm(pGA) GIS network analysis algorithms
  • 相关文献

参考文献15

  • 1HAKIMI S L. Optimal location of switching centers and the ab- solute centers and medians of a graph[J]. Operations Research, 1964,12;450-459.
  • 2SOLOMON M M, DESROSIERS J. Time window constrained routing and scheduling problems[J]. Transportation Science, 1988,22:1-13.
  • 3CHAO M,GOLDEN B L,WASIL E. An improved heuristic for the period vehicle routing problem[J ]. Networks, 1995,26 : 25 -44.
  • 4SAVELSBERGH M W P. Local search in routing problem with time windows[J]. Operations Research, 1985,4: 285-305.
  • 5LAPORTE G, NOBERT Y, ARPIN D. An exact algorithm for solving a eapacitated location-routing problem[J]. Operations Research, 1986,6 : 293- 310.
  • 6OR ILHAN,PIERSKALLA W P. A transportation location-al- location model for regional blood banking[J]. IIE Transactions, 1979,11:86-95.
  • 7JACOBSEN S K, MADSEN O 13. A comparative study of heu- ristics for a two-level routing-location problem[J]. European Journal of Operational Research, 1980,5 : 378- 387.
  • 8GtOR N, SAI"D S. Ixzcation-routing: Issues, models and methods [J]. European Journal of Operational Research, 2007,177 : 649- 672.
  • 9BERTSEKAS D P, TSITSIKLIS J N. Parallel and Distributed Computation: Numerical Methods [M]. New Jersey: Prentice- Hall, 1989. 3-21.
  • 10LIN S C,PUNCH W F,GOODMAN E D. Coarse-grain paral- lel genetic algorithms: Categorization and new approach[A]. LIN S C,PUNCH W F,G(X)DMAN E D. Sixth IEEE Sympo- sium on Parallel and Distributed Processing[C]. US IEEE Computer Society Press, 1994. 28-37.

二级参考文献13

  • 1Sedgewick R,Vitter J S.Shortest paths in Euclidean graphs[J].Algorithmica,1986,1(1):31 ~48.
  • 2Ikeda T,Hsu M Y,Imai H,et al.A fast algorithm for finding better routes by AI search techniques[A].In:Proceedings of IEEE Vehicle Navigation and Information Systems Conference[C],Yokohama,Japan,1994:291 ~ 296.
  • 3Goldberg A V,Harrelson C.Computing the shortest path:A * search meets graph theory[A].In:16th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA'05)[C],Vancouver,Canada,2005:156 ~ 165.
  • 4Philip Klein,Satish Rao,Monika Rauch,et al.Faster shortest-path algorithms for planar graphs[A].In:Proceedings of Annual ACM Symposium on Theory of Com puting[C],Montreal,Quebec,Canada,1994:27 ~37.
  • 5Johnson D B.Priority queues with update and finding minimum spanning trees[J].Information Processing Letters,1975,4 (3):53 ~ 57.
  • 6Brown M R.Implementation and analysis of binomial queue algorithms[J].SIAM Journal on Computing,1978,7(3):298 ~319.
  • 7Fredman M L,Tarjan R E.Fibonacci heaps and their uses in improved network optimization algorithms[J].Journal of the ACM,1987,34(3):596 ~615.
  • 8Fredman M L,Sedgewick R,Sleator D D,et al.The pairing heap:A new form of self-adjusting heap[J].Algorithmica,1986,1(1):111 ~129.
  • 9Stasko J T,Vitter J S.Pairing heaps:experiments and analysis[J].Communications of the ACM,1987,30(3):234 ~249.
  • 10[美]Mark Allen Weiss 著.冯舜玺译.数据结构与算法分析--C语言描述(第二版)[M].北京:机械工业出版社,2005:372~376.

共引文献15

同被引文献69

引证文献3

二级引证文献50

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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