Efficient methods for challenging routing problems
Title: Efficient methods for challenging routing problems
DNr: NAISS 2024/22-411
Project Type: NAISS Small Compute
Principal Investigator: Nils-Hassan Quttineh <nils-hassan.quttineh@liu.se>
Affiliation: Linköpings universitet
Duration: 2024-04-01 – 2025-04-01
Classification: 10105
Keywords:

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.