Variable neighborhood search to solve the generalized orienteering problem
From MaRDI portal
Publication:6070415
DOI10.1111/itor.12800OpenAlexW3020648922MaRDI QIDQ6070415
Unnamed Author, Alfonso Mateos, Gregorio Tirado
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12800
Related Items (1)
Cites Work
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The effective application of a new approach to the generalized orienteering problem
- A fast and effective heuristic for the orienteering problem
- Variable neighborhood search
- Using artificial neural networks to solve the orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- Integer Programming Formulation of Traveling Salesman Problems
- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
- The orienteering problem
- Generalized orienteering problem with resource dependent rewards
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
This page was built for publication: Variable neighborhood search to solve the generalized orienteering problem