Advertisement

Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity

  • Hirotaka IrieEmail author
  • Goragot Wongpaisarnsin
  • Masayoshi Terabe
  • Akira Miki
  • Shinichirou Taguchi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11413)

Abstract

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.

Keywords

Vehicle routing problem QUBO Quantum annealing 

References

  1. 1.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959).  https://doi.org/10.1287/mnsc.6.1.80MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355–5363 (1998).  https://doi.org/10.1103/PhysRevE.58.5355CrossRefGoogle Scholar
  3. 3.
    Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473, 194–198 (2011)CrossRefGoogle Scholar
  4. 4.
    Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 1–5 (2014).  https://doi.org/10.3389/fphy.2014.00005CrossRefGoogle Scholar
  5. 5.
    Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biol. Cybern. 52, 141–152 (1985).  https://doi.org/10.1007/BF00339943CrossRefzbMATHGoogle Scholar
  6. 6.
    Hopfield, J.J., Tank, D.W.: Computing with neural circuits: a model. Sci. New Ser. 233(4764), 625–633 (1986).  https://doi.org/10.1126/science.3755256CrossRefGoogle Scholar
  7. 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. 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. 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

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Hirotaka Irie
    • 1
    Email author
  • Goragot Wongpaisarnsin
    • 2
  • Masayoshi Terabe
    • 1
  • Akira Miki
    • 1
  • Shinichirou Taguchi
    • 1
  1. 1.Information Electronics R&I Department, Electronics R&I DivisionDENSO CorporationTokyoJapan
  2. 2.Contents Development & Distribution DepartmentToyota Tsusho Nexty Electronics (Thailand) Co., LTD.BangkokThailand

Personalised recommendations