The effective application of a new approach to the generalized orienteering problem
From MaRDI portal
Publication:972648
DOI10.1007/S10732-009-9104-8zbMATH Open1187.90078OpenAlexW1980328733MaRDI QIDQ972648FDOQ972648
Authors: John Silberholz, Bruce Golden 
Publication date: 21 May 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-009-9104-8
Recommendations
- Using a genetic algorithm to solve the generalized orienteering problem
- The orienteering problem: a survey
- Orienteering problem: a survey of recent variants, solution approaches and applications
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- An iterated local search algorithm for the team orienteering problem with variable profits
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- The orienteering problem
- A fast and effective heuristic for the orienteering problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Solving the Orienteering Problem through Branch-and-Cut
- Using a genetic algorithm to solve the generalized orienteering problem
Cited In (13)
- The orienteering problem with time windows applied to robotic melon harvesting
- Boosting ant colony optimization via solution prediction and machine learning
- A matheuristic approach to the orienteering problem with service time dependent profits
- An efficient evolutionary algorithm for the orienteering problem
- A survey of the standard location-routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Trip planning for visitors in a service system with capacity constraints
- Variable neighborhood search to solve the generalized orienteering problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- A fast and effective heuristic for the orienteering problem
- Hybrid genetic algorithm for undirected traveling salesman problems with profits
- Using a genetic algorithm to solve the generalized orienteering problem
- Selective generalized travelling salesman problem
Uses Software
This page was built for publication: The effective application of a new approach to the generalized orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972648)
