Author:
Cattelan Michele,Yarkoni Sheir
Abstract
AbstractMany emerging commercial services are based on the sharing or pooling of resources for common use with the aim of reducing costs. Businesses such as delivery-, mobility-, or transport-as-a-service have become standard in many parts of the world, fulfilling on-demand requests for customers in live settings. However, it is known that many of these problems are NP-hard, and therefore both modeling and solving them accurately is a challenge. Here we focus on one such routing problem, the Ride Pooling Problem (RPP), where multiple customers can request on-demand pickups and drop-offs from shared vehicles within a fleet. The combinatorial optimization task is to optimally pool customer requests using the limited set of vehicles, akin to a small-scale flexible bus route. In this work, we propose a quadratic unconstrained binary optimization (QUBO) program and introduce efficient formulation methods for the RPP to be solved using metaheuristics, and specifically emerging quantum optimization algorithms.
Funder
Bundesministerium für Bildung und Forschung
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Kochenberger, G. et al. The unconstrained binary quadratic programming problem: A survey. J. Comb. Optim. 28, 58–81. https://doi.org/10.1007/s10878-014-9734-0 (2014).
2. Lucas, A. Ising formulations of many np problems. Front. Phys. 2, 5 (2014).
3. Farhi, E., Goldstone, J., Gutmann, S. & Sipser, M. Quantum computation by adiabatic evolution. arXiv preprint quant-ph/0001106 (2000).
4. Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. arXiv preprint[SPACE]arXiv:1411.4028 (2014).
5. Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse ising model. Phys. Rev. E 58, 5355 (1998).