Applying quantum approximate optimization to the heterogeneous vehicle routing problem

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

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)

NATURVETENSKAP  -- Fysik (hsv//swe)

NATURAL SCIENCES  -- Physical Sciences (hsv//eng)

TEKNIK OCH TEKNOLOGIER  -- Maskinteknik -- Farkostteknik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Mechanical Engineering -- Vehicle Engineering (hsv//eng)

Nyckelord

combinatorial optimization

variational quantum algorithm

Quantum computing

quantum approximate optimization algorithm

vehicle routing

Publikations- och innehållstyp

lic (ämneskategori)

vet (ämneskategori)