Evolution-inspired local improvement algorithm solving orienteering problem

DOI10.1007/s10479-016-2278-1zbMath1369.90149DBLPjournals/anor/OstrowskiKKZ17OpenAlexW2503238886WikidataQ62046259 ScholiaQ62046259MaRDI QIDQ2399337

Pawel Zabielski, Jolanta Koszelew, Joanna Karbowska-Chilinska, Krzysztof Ostrowski

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

travelling salesman problemoptimization problemorienteering problemevolution-inspired local improvement algorithmtrip planners

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

An efficient evolutionary algorithm for the orienteering problem ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory

Uses Software

• Paramils
• TSPLIB
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The orienteering problem: a survey
• The orienteering problem with stochastic travel and service times
• On the tour planning problem
• 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
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• A path relinking approach for the team orienteering problem
• Local improvement in planar facility location using vehicle routing
• 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
• A TABU search heuristic for the team orienteering problem
• Genetic algorithms for the traveling salesman problem
• A fast solution method for the time-dependent orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• ParamILS: An Automatic Algorithm Configuration Framework
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: Evolution-inspired local improvement algorithm solving orienteering problem