An evolutionary approach for the p-next center problem

作者：

Highlights：

• An evolutionary approach built is developed for the p-next center problem.

• An extension of the current benchmark instances is provided.

• Upper and lower bounds are reported for all instances.

• Computational experiments revealed great performance of the proposed methods.

摘要

•An evolutionary approach built is developed for the p-next center problem.•An extension of the current benchmark instances is provided.•Upper and lower bounds are reported for all instances.•Computational experiments revealed great performance of the proposed methods.

论文关键词：Facility location,Biased Random-Key Genetic Algorithm,Metaheuristics

论文评审过程：Received 9 July 2020, Revised 11 December 2020, Accepted 11 February 2021, Available online 23 February 2021, Version of Record 20 March 2021.

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