The Multi-Service Location Set Covering Problem is an extension of the well-known Set Covering Problem. It arises in practical applications where a set of physical locations need to be equipped with services to satisfy demand within a certain area, while minimizing costs. In this paper we formulate the problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, apply the hybrid framework of the D-Wave quantum annealer to solve it, and investigate the feasibility of this approach. To improve the often suboptimal initial solutions found on the D-Wave system, we develop a hybrid quantum/classical optimization algorithm that starts from the seed solution and iteratively creates small subproblems that are more efficiently solved on the D-Wave but often still converge to feasible and improved solutions of the original problem. Finally we suggest some opportunities for increasing the accuracy and performance of our algorithm.
CITATION STYLE
Chiscop, I., Nauta, J., Veerman, B., & Phillipson, F. (2020). A hybrid solution method for the multi-service location set covering problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12142 LNCS, pp. 531–545). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-50433-5_41
Mendeley helps you to discover research relevant for your work.