On solving close enough orienteering problems with overlapped neighborhoods
Open Access
- 17 May 2024
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 369-387
Abstract
No abstract availableKeywords
All Related Versions
This publication has 30 references indexed in Scilit:
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissanceComputers & Operations Research, 2022
- A learnheuristic approach for the team orienteering problem with aerial drone motion constraintsApplied Soft Computing, 2020
- Data collection path planning with spatially correlated measurements using growing self-organizing arrayApplied Soft Computing, 2019
- A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman ProblemComputers & Operations Research, 2019
- Drone delivery from trucks: Drone scheduling for given truck routesNetworks, 2018
- An efficient evolutionary algorithm for the orienteering problemComputers & Operations Research, 2018
- A novel discretization scheme for the close enough traveling salesman problemComputers & Operations Research, 2017
- Particle swarm optimization (PSO). A tutorialChemometrics and Intelligent Laboratory Systems, 2015
- Online stochastic UAV mission planning with time windows and time-sensitive targetsEuropean Journal of Operational Research, 2014
- The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics2006