An iterated local search algorithm for the team orienteering problem with variable profits
From MaRDI portal
Publication:5058860
DOI10.1080/0305215X.2017.1417398OpenAlexW2783686905WikidataQ59569406 ScholiaQ59569406MaRDI QIDQ5058860
Kien Ming Ng, Junhan Lai, Aldy Gunawan, Graham Kendall
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2017.1417398
Related Items (4)
A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE) ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ Team Orienteering with Time-Varying Profit ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
Cites Work
- Unnamed Item
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving the team orienteering problem with cutting planes
- The orienteering problem: a survey
- The selective travelling salesman problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
- An effective PSO-inspired algorithm for the team orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- An exact algorithm for team orienteering problems
- The split delivery capacitated team orienteering problem
- The orienteering problem
- The Covering Tour Problem
- The orienteering problem with variable profits
This page was built for publication: An iterated local search algorithm for the team orienteering problem with variable profits
