淡江大學機構典藏:Item 987654321/105944
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4029312      Online Users : 560
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/105944


    Title: A hybrid heuristic method for the periodic inventory routing problem
    Authors: Shu-Chu Liu;Ming-Che Lu;Chih-Hung Chung
    Keywords: Periodic inventory routing problem (PIRP);Particle swarm optimization (PSO);Large neighborhood search (LNS);Hybrid heuristic method;NP-hard problem
    Date: 2016-02-29
    Issue Date: 2016-04-22 13:11:46 (UTC+8)
    Publisher: Springer London
    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.
    Relation: The International Journal of Advanced Manufacturing Technology 8(9-12), p.1-8
    DOI: 10.1007/s00170-015-8081-3
    Appears in Collections:[Graduate Institute & Department of Educational Technology ] Journal Article

    Files in This Item:

    File Description SizeFormat
    A hybrid heuristic method for the periodic inventory routing problem.pdf356KbAdobe PDF7View/Open
    index.html0KbHTML263View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback