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
来源：
INTERNATIONAL CONFERENCE ON INDUSTRIAL AND SYSTEMS ENGINEERING (ICONISE) 2017 | 2018年 / 337卷
关键词：
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 条
  • [41] A memory structure adapted simulated annealing algorithm for a green vehicle routing problem
    Kucukoglu, Ilker
    Ene, Seval
    Aksoy, Asli
    Ozturk, Nursel
    ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH, 2015, 22 (05) : 3279 - 3297
  • [42] A TIME-DEPENDENT VEHICLE ROUTING PROBLEM SOLVED BY IMPROVED SIMULATED ANNEALING
    Norouzi, Narges
    Sadegh-Amalnick, Mohsen
    Tavakkoli-Moghaddam, Reza
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2015, 16 (03): : 458 - 465
  • [43] Using stochastic chaotic simulated annealing in the FPGA segmented channel routing problem
    Wang, LP
    Zhang, WS
    PROCEEDINGS OF 2005 IEEE INTERNATIONAL WORKSHOP ON VLSI DESIGN AND VIDEO TECHNOLOGY, 2005, : 288 - 291
  • [44] Adaptive temperature control of simulated annealing for solving capacitated vehicle routing problem
    Turky, Ayad M.
    COMPUTER COMMUNICATION AND MANAGEMENT, 2011, 5 : 80 - 82
  • [45] A memory structure adapted simulated annealing algorithm for a green vehicle routing problem
    İlker Küçükoğlu
    Seval Ene
    Aslı Aksoy
    Nursel Öztürk
    Environmental Science and Pollution Research, 2015, 22 : 3279 - 3297
  • [46] A research into location routing problem based on hybrid genetic simulated annealing algorithm
    Wang, Chengduan, 1600, Transport and Telecommunication Institute, Lomonosova street 1, Riga, LV-1019, Latvia (18):
  • [47] Simulated annealing for the vehicle routing problem with two-dimensional loading constraints
    Stephen C. H. Leung
    Jiemin Zheng
    Defu Zhang
    Xiyue Zhou
    Flexible Services and Manufacturing Journal, 2010, 22 : 61 - 82
  • [48] Hybrid Particle Swarm Optimization and Simulated Annealing for Capacitated Vehicle Routing Problem
    Mar'i, Farhanna
    Mahmudy, Wayan Firdaus
    Santoso, Purnomo Budi
    PROCEEDINGS OF 2019 4TH INTERNATIONAL CONFERENCE ON SUSTAINABLE INFORMATION ENGINEERING AND TECHNOLOGY (SIET 2019), 2019, : 66 - 71
  • [49] An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem
    Ilhan, Ilhan
    SWARM AND EVOLUTIONARY COMPUTATION, 2021, 64
  • [50] IMPROVEMENT HEURISTICS FOR THE VEHICLE-ROUTING PROBLEM-BASED ON SIMULATED ANNEALING
    VANBREEDAM, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 86 (03) : 480 - 490
12345