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

作者：Diaz Juan A; Luna Dolores E^*; Camacho Vallejo Jose Fernando; Casas Ramirez Martha Selene

来源：Expert Systems with Applications, 2017, 82: 67-76.

DOI：10.1016/j.eswa.2017.04.002

• Maximal covering
• Metaheuristics
• GRASP
• Tabu search
• Bilevel programming

In this study, a maximal covering location problem is investigated. In this problem, we want to maximize the demand of a set of customers covered by a set of p facilities located among a set of potential sites. It is assumed that a set of facilities that belong to other firms exists and that customers freely choose allocation to the facilities within a coverage radius. The problem can be formulated as a bilevel mathematical programming problem, in which the leader locates facilities in order to maximize the demand covered and the follower allocates customers to the most preferred facility among those selected by the leader and facilities from other firms. We propose a greedy randomized adaptive search procedure (GRASP) heuristic and a hybrid GRASP-Tabu heuristic to find near optimal solutions. Results of the heuristic approaches are compared to solutions obtained with a single-level reformulation of the problem. Computational experiments demonstrate that the proposed algorithms can find very good quality solutions with a small computational burden. The most important feature of the proposed heuristics is that, despite their simplicity, optimal or near-optimal solutions can be determined very efficiently.

• 出版日期2017-10-1