Simulated annealing with restart strategy for the blood pickup routing problem

被引:4
|
作者
Yu, V. F. [1 ]
Iswari, T. [2 ,3 ]
Normasari, N. M. E. [1 ,2 ]
Asih, A. M. S. [2 ]
Ting, H. [4 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Taipei, Taiwan
[2] Univ Gadjah Mada, Dept Mech & Ind Engn, Yogyakarta, Indonesia
[3] Univ Katolik Parahyangan, Program Studi Tekn Ind, Bandung, Indonesia
[4] Natl Taipei Univ Technol, Dept Informat & Finance Management, Taipei, Taiwan
关键词
TEAM ORIENTEERING PROBLEM; HEURISTIC ALGORITHMS; TRUCK; MODEL;
D O I
10.1088/1757-899X/337/1/012007
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This study develops a simulated annealing heuristic with restart strategy (SA_RS) for solving the blood pickup routing problem (BPRP). BPRP minimizes the total length of the routes for blood bag collection between a blood bank and a set of donation sites, each associated with a time window constraint that must be observed. The proposed SA_RS is implemented in C++ and tested on benchmark instances of the vehicle routing problem with time windows to verify its performance. The algorithm is then tested on some newly generated BPRP instances and the results are compared with those obtained by CPLEX. Experimental results show that the proposed SA_RS heuristic effectively solves BPRP.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows
    Yu, Vincent F.
    Winarno
    Maulidin, Achmad
    Redi, A. A. N. Perwira
    Lin, Shih-Wei
    Yang, Chao-Lung
    MATHEMATICS, 2021, 9 (14)
  • [2] Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing
    Yu, Vincent F.
    Lin, Shin-Yu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (02) : 526 - 549
  • [3] Simulated Annealing for a Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows
    Wang, Chao
    Zhao, Fu
    Mu, Dong
    Sutherland, John W.
    ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS, APMS 2013, PT II, 2013, 415 : 170 - 177
  • [4] Solving vehicle routing problem with simultaneous pickup and delivery using parallel simulated annealing algorithm
    Mu, Dong
    Wang, Chao
    Zhao, Fu
    Sutherland, John W.
    INTERNATIONAL JOURNAL OF SHIPPING AND TRANSPORT LOGISTICS, 2016, 8 (01) : 81 - 106
  • [5] Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery
    Yu, Vincent F.
    Lin, Shih-Wei
    APPLIED SOFT COMPUTING, 2014, 24 : 284 - 290
  • [6] A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows
    Wang, Chao
    Mu, Dong
    Zhao, Fu
    Sutherland, John W.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 83 : 111 - 122
  • [7] Enhanced simulated annealing in the vehicle routing problem
    Ipatov, A. V.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2011, 17 (04): : 121 - 125
  • [8] A simulated annealing heuristic for the hybrid vehicle routing problem
    Yu, Vincent F.
    Redi, A. A. N. Perwira
    Hidayat, Yosi Agustina
    Wibowo, Oktaviyanto Jimat
    APPLIED SOFT COMPUTING, 2017, 53 : 119 - 132
  • [9] Simulated Annealing for the Home Healthcare Routing and Scheduling Problem
    Ceschia, Sara
    Di Gaspero, Luca
    Schaerf, Andrea
    AIXIA 2022 - ADVANCES IN ARTIFICIAL INTELLIGENCE, 2023, 13796 : 402 - 412
  • [10] A simulated annealing heuristic for the consistent vehicle routing problem
    Liu, Heng-Yu
    Ru, Yi-Hong
    Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, 2015, 15 (06): : 177 - 183