An improved exact algorithm for a territory design problem with p-center-based dispersion minimization
作者：
Highlights：
• A districting problem with p-center minimization function is addressed.
• An exact algorithm with a covering reformulation for fasternvergence is proposed.
• The algorithm uses a cut-generation strategy for ensuring territory connectivity.
• Tests with 140 instances with up to 300 nodes prove the efficiency of the method.
• The algorithm outperforms the best existing approach based on statistical analysis.
摘要
•A districting problem with p-center minimization function is addressed.•An exact algorithm with a covering reformulation for fasternvergence is proposed.•The algorithm uses a cut-generation strategy for ensuring territory connectivity.•Tests with 140 instances with up to 300 nodes prove the efficiency of the method.•The algorithm outperforms the best existing approach based on statistical analysis.
论文关键词：Territory design,p-center problem,Integer programming,Model reformulation
论文评审过程：Received 16 August 2019, Revised 12 November 2019, Accepted 19 December 2019, Available online 20 December 2019, Version of Record 13 January 2020.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.113150
