Solve Two-Echelon Location Routing Problem with Dynamic Satellites by Tabu Search combined with K-means

• Main Authors: Chia-En Kang, 康嘉恩
• Other Authors: Chao-Lung Yang
• Format: Others
• Language: en_US
• Published: 2019
• Online Access: http://ndltd.ncl.edu.tw/handle/njwr6x

碩士 === 國立臺灣科技大學 === 工業管理系 === 107 === In this paper, we proposed a new two-echelon location routing problem with dynamic satellites (2E-LRPDS) problem which focus on city logistics. The main innovation of this work is replacing the fix satellites from typical two-echelon location routing problem (2E-LRP) and utilize the truck as dynamic satellites. In this research, a combined Tabu Search with K-means was utilized to solve 2E-LRPDS problem. The proposed model is tested on the 2E-LRP Prodhon benchmark instances. The result shows that the proposed model outperforms the original 2E-LRP models in large instances. The more complicated the problems is, the higher the cost-savings the proposed model can produce. A Taguchi experiments were simulated to obtain the best setting of parameters. As the results, the best-configured parameters reduce both the average and the variance of the total costs.