English

Ising formulations of routing optimization problems

Quantum Physics 2020-12-10 v1

Abstract

We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware.

Keywords

Cite

@article{arxiv.2012.05022,
  title  = {Ising formulations of routing optimization problems},
  author = {Daniel Jaroszewski and Fabian Klos and Benedikt Sturm},
  journal= {arXiv preprint arXiv:2012.05022},
  year   = {2020}
}

Comments

4 pages, 2 figures

R2 v1 2026-06-23T20:50:36.828Z