SUPR
Efficient methods for challenging routing problems
Dnr:

NAISS 2024/22-411

Type:

NAISS Small Compute

Principal Investigator:

Nils-Hassan Quttineh

Affiliation:

Linköpings universitet

Start Date:

2024-04-01

End Date:

2025-04-01

Primary Classification:

10105: Computational Mathematics

Webpage:

Allocation

Abstract

In my research, I'm working with computationally challenging optimization problems focused on routing (as an example, interesting extensions of the vehicle routing problem). Multiple solution approaches and modeling alternatives are investigated, and being able to efficiently perform benchmark tests on modern hardware is key for moving forward.