The Open Location Routing Problem with Inter-Depot Routes

• Main Authors: ShihChieh-Lin, 林士傑
• Other Authors: Vincent F. Yu
• Format: Others
• Language: zh-TW
• Published: 2017
• Online Access: http://ndltd.ncl.edu.tw/handle/ctsz9r

碩士 === 國立臺灣科技大學 === 工業管理系 === 105 === This research introduces the location-routing problem with inter-depot routes (LRPI) and the open location-routing problem with inter-depot routes (OLRPI). LRPI is a variant problem of location-routing problem and it extends the multi-depot vehicle routing problem with inter-depot routes (MDVRPI). LRPI is different from LRP as vehicles may be replenished at intermediate depots along their route. The depot can be repeated passed through by vehicles as long as its capacity limit is not exceeded. The LRPI concerns a closed loop problem in which all the routes start and end at the depot. On the other hand, the OLRPI is an open loop problem in which each vehicle starts from a depot, but ends at a final served customer. The applications of OLPRI include shuttle bus routing and third party logistics. The problem finds a set of the most effective paths to minimize total costs, including depot opening costs, fixed costs, and travel costs, without violating various side constraints. We propose a Simulated Annealing (SA) based heuristic algorithm to solve LRPI and OLRPI. The experiments compare the solutions of LRP, OLRP, LRPI and OLRPI. Experimental results indicate that using Inter -Depot Routes reduces costs for traditional logistics.