Evolution-inspired local improvement algorithm solving orienteering problem
DOI10.1007/S10479-016-2278-1zbMATH Open1369.90149DBLPjournals/anor/OstrowskiKKZ17OpenAlexW2503238886WikidataQ62046259 ScholiaQ62046259MaRDI QIDQ2399337FDOQ2399337
Authors: Krzysztof Ostrowski, Joanna Karbowska-Chilinska, Jolanta Koszelew, Pawel Zabielski 
Publication date: 22 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2278-1
Recommendations
optimization problemorienteering problemtravelling salesman problemevolution-inspired local improvement algorithmtrip planners
Cites Work
- Paramils: an automatic algorithm configuration framework
- The orienteering problem
- A method for solving traveling-salesman problems
- The orienteering problem: a survey
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- A fast and effective heuristic for the orienteering problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Title not available (Why is that?)
- An Optimal Algorithm for the Orienteering Tour Problem
- Solving the Orienteering Problem through Branch-and-Cut
- Title not available (Why is that?)
- The orienteering problem with stochastic travel and service times
- Iterated local search for the team orienteering problem with time windows
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- The selective travelling salesman problem
- A TABU search heuristic for the team orienteering problem
- A path relinking approach for the team orienteering problem
- A fast solution method for the time-dependent orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- Genetic algorithms for the traveling salesman problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- Title not available (Why is that?)
- Local improvement in planar facility location using vehicle routing
- On the tour planning problem
Cited In (7)
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
- An efficient evolutionary algorithm for the orienteering problem
- Trip planning for visitors in a service system with capacity constraints
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- Hybrid genetic algorithm for undirected traveling salesman problems with profits
Uses Software
This page was built for publication: Evolution-inspired local improvement algorithm solving orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399337)
