GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering

作者：

Highlights：

• A maximal covering location problem with customer preferences is studied.

• A GRASP and a hybrid GRASP-Tabu heuristics to find lower bounds are proposed.

• The heuristics are tested with medium and large size instances.

• Despite the heuristics simplicity, they provide high quality solutions efficiently.

• The proposed heuristics are competitive against commercial optimization software.

摘要

•A maximal covering location problem with customer preferences is studied.•A GRASP and a hybrid GRASP-Tabu heuristics to find lower bounds are proposed.•The heuristics are tested with medium and large size instances.•Despite the heuristics simplicity, they provide high quality solutions efficiently.•The proposed heuristics are competitive against commercial optimization software.

论文关键词：Maximal covering,Metaheuristics,GRASP,Tabu search,Bilevel programming

论文评审过程：Received 22 June 2016, Revised 31 March 2017, Accepted 1 April 2017, Available online 2 April 2017, Version of Record 8 April 2017.

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