An Accelerated Benders Decomposition Algorithm for Solving a Double-Type Double-Standard Maximal Covering Location Problem

Abstract

In this paper, a double-type double-standard model (DtDsM) for maximal covering location problem is proposed which has several applications in determining the location of public emergency facilities. DtDsM includes two types of facilities: normal and backup facilities. Although backup facilities have a greater coverage distance, they offer not a full service but only a primary service. In DtDsM, each demand point must lie within the coverage distance of a backup facility if it does not lie in the coverage distance of a normal facility ensuring it to receive minimal primary services within a predetermined time. Furthermore, an accelerated Benders decomposition algorithm is proposed to solve the model. The speed and accuracy of the algorithm are compared with the commercial solver CPLEX.