Using quantum computing to solve the maximal covering location problem

Alejandro Giraldo-Quintero , Juan G. Lalinde-Pulido , Juan C. Duque , Daniel Sierra-Sosa

Computational Urban Science ›› 2022, Vol. 2 ›› Issue (1) : 43

PDF
Computational Urban Science ›› 2022, Vol. 2 ›› Issue (1) : 43 DOI: 10.1007/s43762-022-00070-x
Original Paper

Using quantum computing to solve the maximal covering location problem

Author information +
History +
PDF

Abstract

In this article, we present the process and results of using quantum computing (QC) to solve the maximal covering location problem proposed by Church and ReVelle. With this contribution, we seek to lay the foundations for other urban and regional scientists to begin to consider quantum technologies. We obtained promising results, but it is clear that there is a need for more capable devices with more qubits and less susceptibility to electronic noise to solve instances that currently cannot be optimally solved by traditional solvers. We foresee that QC will be of common use in urban and regional science and its applications in the years to come.

Cite this article

Download citation ▾
Alejandro Giraldo-Quintero, Juan G. Lalinde-Pulido, Juan C. Duque, Daniel Sierra-Sosa. Using quantum computing to solve the maximal covering location problem. Computational Urban Science, 2022, 2(1): 43 DOI:10.1007/s43762-022-00070-x

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

Global Challenges Research Fund,(ES/P011055/1)

Jiangxi Normal University,

AI Summary AI Mindmap
PDF

154

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/