Simulated annealing with restart strategy for the blood pickup routing problem

International Conference on Industrial and Systems Engineering 2017

Yu, V.F.^1 ; Iswari, T.^1,2,3 ; Normasari, N.M.E.^1,2 ; Asih, A.M.S.^2 ; Ting, H.^4

Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan^1

Department of Mechanical and Industrial Engineering, Universitas Gadjah Mada, Yogyakarta, Indonesia^2

Program Studi Teknik Industri, Universitas Katolik Parahyangan, Bandung, Indonesia^3

Department of Information and Finance Management, National Taipei University of Technology, Taipei, Taiwan^4

关键词: Blood bag;    Blood bank;    Restart strategy;    Routing problems;    Time window constraint;    Total length;    Vehicle routing problem with time windows;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/337/1/012007/pdf
DOI  :  10.1088/1757-899X/337/1/012007

来源: IOP

【 摘 要 】

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.