Next Article in Journal
Enhancing Backtracking Search Algorithm using Reflection Mutation Strategy Based on Sine Cosine
Previous Article in Journal
(Hyper)Graph Embedding and Classification via Simplicial Complexes
Open AccessArticle

A QUBO Model for the Traveling Salesman Problem with Time Windows

Department of Informatics, Ionian University, Tsirigoti Square 7, 49100 Corfu, Greece
*
Authors to whom correspondence should be addressed.
Algorithms 2019, 12(11), 224; https://doi.org/10.3390/a12110224
Received: 14 September 2019 / Revised: 22 October 2019 / Accepted: 22 October 2019 / Published: 25 October 2019
This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality constraints, which are known to be particularly difficult to articulate within the QUBO framework. This is, we believe, the first time this major obstacle is overcome and the TSPTW is cast in the QUBO formulation. We have every reason to anticipate that this development will lead to the actual execution of small scale TSPTW instances on the D-Wave platform. View Full-Text
Keywords: TSP; TSPTW; metaheuristics; quantum annealing; Ishing model; QUBO; D-Wave TSP; TSPTW; metaheuristics; quantum annealing; Ishing model; QUBO; D-Wave
Show Figures

Figure 1

MDPI and ACS Style

Papalitsas, C.; Andronikos, T.; Giannakis, K.; Theocharopoulou, G.; Fanarioti, S. A QUBO Model for the Traveling Salesman Problem with Time Windows. Algorithms 2019, 12, 224.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop