Transit facility allocation: Hybrid quantum-classical optimization
arXiv:2210.12558 · doi:10.1371/journal.pone.0274632
Abstract
An essential consideration in urban transit facility planning is service efficiency and accessibility. Previous research has shown that reducing the number of facilities along a route may increase efficiency but decrease accessibility. Striking a balance between these two is a critical consideration in transit planning. Transit facility consolidation is a cost-effective way to improve the quality of service by strategically determining the desirable allocation of a limited number of facilities. This paper develops an optimization framework that integrates Geographical Information systems (GIS), decision-making analysis, and quantum technologies for addressing the problem of facility consolidation. Our proposed framework includes a novel mathematical model that captures non-linear interactions between facilities and surrounding demand nodes, inter-facility competition, ridership demand and spatial coverage. The developed model can harness the power of quantum effects such as superposition and quantum tunnelling and enables transportation planners to utilize the most recent hardware solutions such as quantum and digital annealers, coherent Ising Machines and gate-based universal quantum computers. This study presents a real-world application of the framework to the public transit facility redundancy problem in the British Columbia Vancouver metropolitan area. We demonstrate the effectiveness of our framework by reducing the number of facilities by 40% while maintaining the same service accessibility. Additionally, we showcase the ability of the proposed mathematical model to take advantage of quantum annealing and classical optimization techniques.
References in corpus (13)
- Quantum Computing in the NISQ era and beyond
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Approximate Optimization Algorithm
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- A Quantum Algorithm for Finding the Minimum
- Combinatorial Optimization with Physics-Inspired Graph Neural Networks
- Quantum Computing based Hybrid Solution Strategies for Large-scale Discrete-Continuous Optimization Problems
- Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
- Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing