An augmented large neighborhood search method for solving the team orienteering problem
- 1 June 2013
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (8) , 3065-3072
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A PSO-Based Memetic Algorithm for the Team Orienteering Problem2011
- A memetic algorithm for the team orienteering problem4OR, 2009
- Metaheuristics for the team orienteering problemJournal of Heuristics, 2006
- An exact algorithm for team orienteering problems4OR, 2006
- Traveling Salesman Problems with ProfitsTransportation Science, 2005
- A survey of very large-scale neighborhood search techniquesDiscrete Applied Mathematics, 2002
- An optimal solution procedure for the multiple tour maximum collection problem using column generationComputers & Operations Research, 1999
- The team orienteering problemEuropean Journal of Operational Research, 1996
- A fast and effective heuristic for the orienteering problemEuropean Journal of Operational Research, 1996
- A heuristic for the multiple tour maximum collection problemComputers & Operations Research, 1994