Travelling Salesman Problem#
This repository contains TSP problem instances using time encoding in Ising format for benchmarking Quantum Annealers and other Ising / QUBO solvers.
Quick Start#
from juniqutils import load_ising_file
# Load problem definition into Python dictionary
problem = load_ising_file(...)
# Then submit the problem to the QPU
Examples and verification runs can be found in source/verify-problems.ipynb.
To see how the problems are generated, check source/generate-problems.ipynb.
Overview#
Each instance describes the problem of finding an optimal route through several cities in Europe.
The objective is to minimize the total drive time in hours.
An example for a subset of the cities is shown in the following map:
See the references below for details on the mathematical problem specification.
Additional References#
JUNIQ School on Quantum Computing: https://jugit.fz-juelich.de/qip/JUNIQ_School_on_QC/-/tree/main/tsp_DWAVE
Bachelor’s Thesis by Nikolaos Tsakalias: Comparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer