A QUBO Model for the Traveling Salesman Problem with Time Windows

被引：46

作者：

Papalitsas, Christos ^{[1
]}

Andronikos, Theodore ^{[1
]}

Giannakis, Konstantinos ^{[1
]}

Theocharopoulou, Georgia ^{[1
]}

Fanarioti, Sofia ^{[1
]}

机构：

[1] Ionian Univ, Dept Informat, Tsirigoti Sq 7, Corfu 49100, Greece

来源：

ALGORITHMS | 2019年 / 12卷 / 11期

关键词：

TSP; TSPTW; metaheuristics; quantum annealing; Ishing model; QUBO; D-Wave; ADIABATIC QUANTUM COMPUTATION; ALGORITHM; OPTIMIZATION;

D O I：

10.3390/a12110224

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页数：21

共 50 条

[41] Optimised forage harvester routes as solutions to a traveling salesman problem with clusters and time windows
Cerdeira-Pena, Ana
Carpente, Luisa
Amiama, Carlos
[J]. BIOSYSTEMS ENGINEERING, 2017, 164 : 110 - 123
[42] New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
Baldacci, Roberto
Mingozzi, Aristide
Roberti, Roberto
[J]. INFORMS JOURNAL ON COMPUTING, 2012, 24 (03) : 356 - 371
[43] Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
Rimmel, Arpad
Teytaud, Fabien
Cazenave, Tristan
[J]. APPLICATIONS OF EVOLUTIONARY COMPUTATION, PT II, 2011, 6625 : 501 - +
[44] Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
Ramon Faganello Fachini
Vinícius Amaral Armentano
[J]. Optimization Letters, 2020, 14 : 579 - 609
[45] Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
Rocha, Yure
Subramanian, Anand
[J]. COMPUTERS & OPERATIONS RESEARCH, 2023, 155
[46] The traveling salesman problem: A hierarchical model
Scott M. Graham
Anupam Joshi
Zygmunt Pizlo
[J]. Memory & Cognition, 2000, 28 : 1191 - 1204
[47] The traveling salesman problem: A hierarchical model
Graham, SM
Joshi, A
Pizlo, Z
[J]. MEMORY & COGNITION, 2000, 28 (07) : 1191 - 1204
[48] Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks
Boland, Natashia
Hewitt, Mike
Duc Minh Vu
Savelsbergh, Martin
[J]. INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING, CPAIOR 2017, 2017, 10335 : 254 - 262
[49] The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty
Bartolini, Enrico
Goeke, Dominik
Schneider, Michael
Ye, Mengdie
[J]. TRANSPORTATION SCIENCE, 2021, 55 (02) : 371 - 394
[50] Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
Yurtkuran, Alkin
Emel, Erdal
[J]. SCIENTIFIC WORLD JOURNAL, 2014,

← 1 2 3 4 5 →