东北大学学报(自然科学版) ›› 2003, Vol. 24 ›› Issue (1): 31-34.DOI: -

• 论著 • 上一篇    下一篇

集成化物流中的定位运输路线安排问题(LRP)优化算法评述

张潜;高立群;胡祥培   

  1. 东北大学信息科学与工程学院 ; 东北大学信息科学与工程学院 ; 大连理工大学系统工程研究所 辽宁沈阳 110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2003-01-15 发布日期:2013-06-23
  • 通讯作者: Zhang, Q.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(70171040,70031020)·

Review on optimal algorithms of location-routing problem (LRP) in integrated logistics

Zhang, Qian (1); Gao, Li-Qun (1); Hu, Xiang-Pei (2)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China; (2) Inst. of Syst. Eng., Univ. of Technol., Dalian 116023, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2003-01-15 Published:2013-06-23
  • Contact: Zhang, Q.
  • About author:-
  • Supported by:
    -

摘要: 总结定位 运输路线安排问题(Location RoutingProblem,LRP)的发展历程,重点评述LRP优化算法的研究进展,并对比分析了常用的两类求解LRP问题的方法精确算法和启发式算法·并对LRP中的定位配给、运输车辆路线安排、定位 运输路线安排三类问题的具体优化方法进行了分析、比较,指出在求解LRP问题时应综合利用各种技术的优势,建立一种新的搜索方法,实现准确、高效的搜索,改进遗传算法用于求解LRP问题是解决这类NP hard问题的一条途径·

关键词: 集成化物流, 定位运输路线安排问题(LRP), 运输路线安排问题(VRP), 定位配给问题(LA), 优化算法, 遗传算法

Abstract: The development of Location-Routing Problem (LRP) was summarized and the advance of optimal algorithm of LRP was reviewed. Two common optimal algorithms to solve LRP, exact algorithm and heuristics algorithm, were analyzed. The optimal algorithm for three problems of LRP including location-allocation problems (LA), vehicle routing problem (VRP), and location-routing problem (LRP) were compared and contracted. Some possible paths for further research in this field were presented. The accurate and efficient search method for solving LRP should take the advantages of different techniques. The improved genetic algorithm (GA) provides a way to solve LRP, which is a NP-hard problem.

中图分类号: