A hybrid heuristic method for the periodic inventory routing problem
學年 104
學期 2
出版（發表）日期 2016-02-29
作品名稱 A hybrid heuristic method for the periodic inventory routing problem
作品名稱（其他語言）
著者 Shu-Chu Liu; Ming-Che Lu; Chih-Hung Chung
單位
出版者
著錄名稱、卷期、頁數 The International Journal of Advanced Manufacturing Technology 8(9-12), p.1-8
摘要 The periodic inventory routing problem (PIRP) determines the delivery routing and the inventory policies for retailers from a supplier in a periodic time based on the minimal cost criterion. Since it is a non-deterministic polynomial-time (NP)-hard problem, a heuristic method is needed for this problem. In the past, different global heuristic methods, such as tabu search (TS) and simulated annealing (SA), have been proposed; however, they seem ineffective. Particle swarm optimization (PSO) is known as resolving multidimensional combinatorial problems such as PIRP; however, it is easily trapped in local optimality. The authors of this paper propose a hybrid heuristic method for the PIRP. The hybrid method integrates a large neighborhood search (LNS) into PSO to overcome the drawbacks of PSO and LNS. The PSO is adopted first. A local search is applied to each particle in different iterations. Then, a local optimal solution (particle) for each particle is obtained. Last, the LNS is applied to the global best solution to avoid becoming trapped in local optimality. The results show that the proposed hybrid heuristic method is 10.93 % better than the existing method and 1.86 % better than the pure heuristic method in terms of average cost.
關鍵字 Periodic inventory routing problem (PIRP);Particle swarm optimization (PSO);Large neighborhood search (LNS);Hybrid heuristic method;NP-hard problem
語言 en
ISSN 1433-3015
期刊性質 國外
收錄於 SCI
產學合作
通訊作者 Chih-Hung Chung
審稿制度 是
國別 GBR
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/105944 )

SDGS 產業創新與基礎設施