Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity
We propose a brand-new formulation for capacitated vehicle routing problem (CVRP) as a quadratic unconstrained binary optimization (QUBO). The formulated CVRP is equipped with time-table which describes time-evolution of each vehicle. Therefore, various constraints associated with time can be successfully realized. Similarly, constraints of capacities are also introduced, where capacitated quantities are allowed to increase and decrease according to the cities in which vehicles arrive. As a bonus of capacity-qubits, one can also obtain a description of state, which allows us to set various traveling rules, depending on the state of each vehicle. As a consistency check, the proposed QUBO formulation is also evaluated using a quantum annealing machine, D-Wave 2000Q.
KeywordsVehicle routing problem QUBO Quantum annealing
- 7.Mèzard, M., Parisi, G.: Replicas and optimization. J. Phys. Lett. 46, 771–778 (1985). https://doi.org/10.1051/jphyslet:019850046017077100CrossRefGoogle Scholar
- 8.Itoh, T., Ohta, M., Yamazaki, Y., Tanaka, S.: Quantum annealing for combinatorial optimization problems with multiple constraints. In: A poster in Adiabatic Quantum Computing Conference, AQC-17, 26 June 2017, Tokyo, Japan (2017)Google Scholar
- 9.Feld, S., Gabor, T.: As a jointwork with Volkswagen: A talk in Qubits Europe 2018 D-Wave Users Conference, 12 April 2018, Munich, Germany. https://www.dwavesys.com/sites/default/files/lmu-merged-published.pdf