Combined Location-Arc Routing Problems:A Survey and Suggestions for Future Research

摘要：

In this paper,the Location-Arc Routing Problem (LARP),a relatively new problem with less research in the past,is surveyed.First,we discuss the relationships and differences between the LARP and the Location-Allocation Problem (LAP),the Capacitated Arc Routing Problem (CARP) and the Location-Routing Problem (LRP).Second,both exact and heuristic algorithms are investigated.Finally,some future research trends such as variants of the LARP and better algorithms are presented.Our objective is to make the LARP easier to be systematically understood and draw more attention on it from researchers and practitioners.

关键词： Location-Arc Routing Problem Integrated Logistics Survey Algorithms

作者: Tiantang Liu Zhibin Jiang Feng Chen Ran Liu Shujun Liu

作者单位: Department of Industrial Engineering and Logistics ManagementShanghai Jiao Tong UniversityShanghai,P Department of Industrial Engineering and Logistics Management Shanghai Jiao Tong University Shanghai

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）