An adaptive memory matheuristic for the set orienteering problem
Authors:
- Michael DontasMDMichael Dontas
- Georgios SiderisGSGeorgios Sideris
- Eleftherios G. ManousakisEMEleftherios G. Manousakis
- Emmanouil E. ZachariadisEZEmmanouil E. Zachariadis
- 10 February 2023
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 309 (3) , 1010-1023
Abstract
No abstract availableKeywords
Funding Information
- Hellenic Foundation for Research and Innovation (02562)
This publication has 30 references indexed in Scilit:
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- A random-key genetic algorithm for the generalized traveling salesman problemEuropean Journal of Operational Research, 2006
- Solving the vehicle routing problem with adaptive memory programming methodologyComputers & Operations Research, 2005
- Adaptive memory programming: A unified view of metaheuristicsEuropean Journal of Operational Research, 2001
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Some Applications of the Generalized Travelling Salesman ProblemJournal of the Operational Research Society, 1996
- A fast and effective heuristic for the orienteering problemEuropean Journal of Operational Research, 1996
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984
- Procedures for travelling salesman problems with additional constraintsEuropean Journal of Operational Research, 1979
- A fast string searching algorithmCommunications of the ACM, 1977