Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A QUBO Model for the Traveling Salesman Problem with Time Windows for Execution on the D-Wave

Version 1 : Received: 14 September 2019 / Approved: 15 September 2019 / Online: 15 September 2019 (16:14:15 CEST)

A peer-reviewed article of this Preprint also exists.

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. 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.

Journal reference: Algorithms 2019, 12, 224
DOI: 10.3390/a12110224

Abstract

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.

Subject Areas

TSP; TSPTW; metaheuristics; quantum annealing; Ishing model; QUBO; D-Wave

Views 0