Applying quantum approximate optimization to the heterogeneous vehicle routing problem
Licentiatavhandling, 2022

Quantum computing offers new heuristics for combinatorial problems. With small- and intermediate-scale quantum devices becoming available, it is possible to implement and test these heuristics on small-size problems. A candidate for such combinatorial problems is the heterogeneous vehicle routing problem (HVRP): the problem of finding the optimal set of routes, given a heterogeneous fleet of vehicles with varying loading capacities, to deliver goods to a given set of customers. This licentiate thesis is an extended introduction to the accompanying paper, which consists of a study of a new formulation of the HVRP applicable to both quantum annealers and programmable noisy intermediate-scale quantum (NISQ) devices.

combinatorial optimization

variational quantum algorithm

Quantum computing

quantum approximate optimization algorithm

vehicle routing

Författare

David Fitzek

Chalmers, Mikroteknologi och nanovetenskap, Tillämpad kvantfysik

Kategorisering

Ämneskategorier (SSIF 2011)

Data- och informationsvetenskap

Beräkningsmatematik

Fysik

Farkostteknik

Övrigt

Serie

Technical report MC2 - Department of Microtechnology and Nanoscience, Chalmers University of Technology: 450

Utgivare

Chalmers

Examination

2022-05-23 15:00 -- 16:00

Kollektorn

Opponent: Assistant Professor Evert Van Nieuwenburg from the University of Copenhagen

Mer information

Senast uppdaterat

2022-06-30