A Study on the Solution Approach for the Location-Routing Problem with Backhauls

• Main Authors: Hsin-Hung Chen, 陳信宏
• Other Authors: Tai-Hsi Wu
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/55783140406250584750

碩士 === 大葉大學 === 工業工程研究所 === 89 === Location-routing problem (LRP) determines the number, locations of depots (warehouses or distribution centers) and the corresponding routing sequence for customers served by each depot. LRP integrates both location-allocation and general routing problems, and is hence very hard to solve to optimality. Routing problems with backhaul are realistic and usually discussed in the literature. However, to the best of our knowledge, we have not seen any article considering both location and routing problem with backhaul simultaneously. This research therefore studies the solution method for solving the LRP with Backhauls (LRPB). A simulated annealing (SA) heuristic approach is developed first to solve the LRP. This SA algorithm is later used as the base and is modified to solve the LRPB. From the results of solving test problems from the literature and designed in this study, it can be observed that the proposed solution method performed quite well.