Modified swarm intelligence algorithms for the pharmacy duty scheduling problem

作者：

Highlights：

• A new variant of PDSP for on-duty pharmacies under distance restriction.

• Binary and Random-Key versions of PSO, GWO, DA, and HHO are adapted for PDSP.

• Modified GWO performs the best in computational time and efficiency.

摘要

•A new variant of PDSP for on-duty pharmacies under distance restriction.•Binary and Random-Key versions of PSO, GWO, DA, and HHO are adapted for PDSP.•Modified GWO performs the best in computational time and efficiency.

论文关键词：Pharmacy duty scheduling,Swarm intelligence algorithms,p-median problem,Location covering,Distance restriction

论文评审过程：Received 14 April 2021, Revised 23 February 2022, Accepted 11 April 2022, Available online 20 April 2022, Version of Record 30 April 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.117246