A QUBO Model for the Traveling Salesman Problem with Time Windows

A QUBO Model for the Traveling Salesman Problem with Time Windows

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

Full description

Bibliographic Details
Main Authors: Christos Papalitsas, Theodore Andronikos, Konstantinos Giannakis, Georgia Theocharopoulou, Sofia Fanarioti
Format: Article
Language:English
Published: MDPI AG 2019-10-01
Series:Algorithms
Subjects:
tsp
tsptw
metaheuristics
quantum annealing
ishing model
qubo
d-wave
Online Access:https://www.mdpi.com/1999-4893/12/11/224

Similar Items

Similar Items