An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem
作者：
Highlights：
• We devise a simulated annealing based adaptive large neighborhood search procedure.
• We include an extensive computation study using 450 publicly available data sets.
• We provide a direct comparison with previous research in this area.
• We gain improvements in solution quality of 22%, but use much more computation time.
摘要
Highlights•We devise a simulated annealing based adaptive large neighborhood search procedure.•We include an extensive computation study using 450 publicly available data sets.•We provide a direct comparison with previous research in this area.•We gain improvements in solution quality of 22%, but use much more computation time.
论文关键词：Metaheuristic,Adaptive large neighborhood search,Patient admission scheduling
论文评审过程：Received 9 March 2016, Revised 25 October 2016, Accepted 25 October 2016, Available online 16 November 2016, Version of Record 3 December 2016.
论文官网地址：https://doi.org/10.1016/j.artmed.2016.10.002
