A multi-objective open set orienteering problem
Authors:
- 3 March 2020
- journal article
- research article
- Published by Springer Nature in Neural Computing and Applications
- Vol. 32 (17) , 13953-13969
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- Metaheuristics for the bi-objective orienteering problemSwarm Intelligence, 2009
- Traveling Salesman Problems with ProfitsTransportation Science, 2005
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman ProblemOperations Research, 1997
- A fast and effective heuristic for the orienteering problemEuropean Journal of Operational Research, 1996
- The selective travelling salesman problemDiscrete Applied Mathematics, 1990
- The prize collecting traveling salesman problemNetworks, 1989
- The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization.Journal of the Operational Research Society, 1986
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984