Evolution-inspired local improvement algorithm solving orienteering problem

DOI10.1007/S10479-016-2278-1MaRDI QIDQ2399337zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

optimization problemorienteering problemtravelling salesman problemevolution-inspired local improvement algorithmtrip planners

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An efficient evolutionary algorithm for the orienteering problem
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• The orienteering problem: a survey
• Solving the Orienteering Problem through Branch-and-Cut
• A fast and effective heuristic for the orienteering problem

Cites work

• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 4125195 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• A TABU search heuristic for the team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A fast solution method for the time-dependent orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• A method for solving traveling-salesman problems
• A path relinking approach for the team orienteering problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• An Optimal Algorithm for the Orienteering Tour Problem
• Genetic algorithms for the traveling salesman problem
• Iterated local search for the team orienteering problem with time windows
• Local improvement in planar facility location using vehicle routing
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• On the tour planning problem
• Paramils: an automatic algorithm configuration framework
• Solving the Orienteering Problem through Branch-and-Cut
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The orienteering problem: a survey
• The selective travelling salesman problem

Cited in

(7)

• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
• An efficient evolutionary algorithm for the orienteering problem
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Trip planning for visitors in a service system with capacity constraints

Describes a project that uses

Uses Software

• Paramils
• TSPLIB
• VRP

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)