淡江大學機構典藏:Item 987654321/109398
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62819/95882 (66%)
造訪人次 : 4007837      線上人數 : 597
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/109398


    題名: Simulated Annealing for the Blood Pickup Routing Problem
    作者: Iswari, Titi;Yu, Vincent F.;Asih, Anna Maria Sri
    關鍵詞: Blood pickup;time window;spoilage time;simulated annealing;vehicle routing problem
    日期: 2016
    上傳時間: 2017-02-13 16:27:51 (UTC+8)
    出版者: 淡江大學出版中心
    摘要: Blood service operation is a key component of healthcare systems all over the world.
    Transporting time-sensitive products like blood presents a specific and unique challenge, as such perishable products have a spoilage time before which they must be used to avoid deterioration. Therefore, if the spoilage time is exceeded, then the product should be discarded. The blood pickup routing problem (BPRP) focuses on the upstream activities of blood logistics,
    starting from collection or pickup of blood bags at fixed donation sites and then
    delivering the blood bags to the blood bank. BPRP is an extension of the well-known vehicle routing problem with time windows. In BPRP, the set of vehicle routes are constructed to minimize total distance while at the same time observing time window constraints of donation sites and the spoilage time constraint of the blood. More specifically, each donation site has its time window during which a vehicle can start collecting blood bags at the site.
    The blood bags must be transported back to the blood bank before the bank’s closing time and the blood’s spoilage time. This study develops a mathematical programming model for BPRP. Since CPLEX can only solve the model to optimality for small instances, this study proposes a simulated annealing (SA) based heuristic approach to solve medium and large BPRP instances. We test the proposed SA heuristic on BPRP instances generated by this study. Computational results show that the proposed SA heuristic performs well on solving BPRP.
    關聯: International Journal of Information and Management Sciences 27 (4), pp.317-327
    DOI: 10.6186/IJIMS.2016.27.4.1
    顯示於類別:[資訊與管理科學期刊] 第27卷第4期

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html全文連結0KbHTML448檢視/開啟

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

    TAIR相關文章

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