Ising formulations of routing optimization problems
arXiv:2012.05022
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.
4 pages, 2 figures