Algorithm selection for the team orienteering problem

DOI10.1007/978-3-031-04148-8_3zbMath1499.90187OpenAlexW4225683452MaRDI QIDQ2163778

Mustafa Mısır, Pieter Vansteenwegen, Aldy Gunawan

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-04148-8_3

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Uses Software

• SATzilla
• Alors
• AutoFolio

Cites Work

• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• \textsc{Alors}: an algorithm recommender system
• Iterated local search for the team orienteering problem with time windows
• A memetic algorithm for the team orienteering problem
• A path relinking approach for the team orienteering problem
• The team orienteering problem
• Variable neighborhood search
• Variable neighborhood search: basics and variants
• A TABU search heuristic for the team orienteering problem
• An effective PSO-inspired algorithm for the team orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• Singular value decomposition and least squares solutions
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• The orienteering problem
• Tabu Search—Part I
• Tabu Search—Part II
• Random forests

This page was built for publication: Algorithm selection for the team orienteering problem