淡江大學機構典藏:Item 987654321/105944
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62819/95882 (66%)
造訪人次 : 4004179      線上人數 : 677
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/105944


    題名: A hybrid heuristic method for the periodic inventory routing problem
    作者: Shu-Chu Liu;Ming-Che Lu;Chih-Hung Chung
    關鍵詞: Periodic inventory routing problem (PIRP);Particle swarm optimization (PSO);Large neighborhood search (LNS);Hybrid heuristic method;NP-hard problem
    日期: 2016-02-29
    上傳時間: 2016-04-22 13:11:46 (UTC+8)
    出版者: Springer London
    摘要: 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.
    關聯: The International Journal of Advanced Manufacturing Technology 8(9-12), p.1-8
    DOI: 10.1007/s00170-015-8081-3
    顯示於類別:[教育科技學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    A hybrid heuristic method for the periodic inventory routing problem.pdf356KbAdobe PDF7檢視/開啟
    index.html0KbHTML263檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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