English  |  正體中文  |  简体中文  |  Items with full text/Total items : 63183/95881 (66%)
Visitors : 4386017      Online Users : 95
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/109398

    Title: Simulated Annealing for the Blood Pickup Routing Problem
    Authors: Iswari, Titi;Yu, Vincent F.;Asih, Anna Maria Sri
    Keywords: Blood pickup;time window;spoilage time;simulated annealing;vehicle routing problem
    Date: 2016
    Issue Date: 2017-02-13 16:27:51 (UTC+8)
    Publisher: 淡江大學出版中心
    Abstract: 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.
    Relation: International Journal of Information and Management Sciences 27 (4), pp.317-327
    DOI: 10.6186/IJIMS.2016.27.4.1
    Appears in Collections:[International Journal of Information and Management Sciences] v.27 n.4

    Files in This Item:

    File Description SizeFormat

    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