A hybrid heuristic method for the periodic inventory routing problem. Issue 9 (August 2016)

• Record Type: Journal Article
• Authors: Liu, Shu-Chu; Lu, Ming-Che; Chung, Chih-Hung
• Is Part Of: International journal of advanced manufacturing technology. Volume 85:Issue 9/12(2016)
• Page Start: 2345
• Page End: 2352
• Publication Date: 2016-08
• Subjects: Periodic inventory routing problem (PIRP) -- Particle swarm optimization (PSO) -- Large neighborhood search (LNS) -- Hybrid heuristic method -- NP-hard problem; Manufacturing processes -- Periodicals; Production engineering -- Periodicals; 670.427
• DOI: 10.1007/s00170-015-8081-3
• Languages: English
• ISSNs: 0268-3768

Abstract

Abstract 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.