The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search
Authors:
- Nacima LabadieNLNacima Labadie
- Renata MansiniRenata Mansini
- Jan MelechovskýJMJan Melechovský
- Roberto Wolfler CalvoRoberto Wolfler Calvo
- 1 July 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 220 (1) , 15-27
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A memetic algorithm for the team orienteering problem4OR, 2009
- Ants can solve the team orienteering problemComputers & Industrial Engineering, 2008
- An exact algorithm for team orienteering problems4OR, 2006
- A TABU search heuristic for the team orienteering problemComputers & Operations Research, 2005
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- The Orienteering Problem with Time WindowsJournal of the Operational Research Society, 1992
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Algorithms to solve the orienteering problem: A comparisonEuropean Journal of Operational Research, 1989
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960