Journal of Northeastern University(Natural Science)

Journal of Northeastern University ›› 2003, Vol. 24 ›› Issue (1): 31-34.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

RichHTML

0

PDF (PC)

1617

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.

CLC Number: