A Tabu search algorithm for the probabilistic orienteering problem

DOI10.1016/j.cor.2020.105107OpenAlexW3090402613MaRDI QIDQ2026967

Xiaochen Chou, Roberto Montemanni, Luca Maria Gambardella

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105107

zbMATH Keywords

Tabu searchMonte Carlo samplingmetaheuristic algorithmsprobabilistic orienteering problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

A reinforcement learning approach to the orienteering problem with time windows ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The clustered orienteering problem
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
• The orienteering problem: a survey
• The orienteering problem with stochastic travel and service times
• Iterated local search for the team orienteering problem with time windows
• The selective travelling salesman problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Algorithms to solve the orienteering problem: A comparison
• A fast and effective heuristic for the orienteering problem
• The probabilistic orienteering problem
• A TABU search heuristic for the team orienteering problem
• Future paths for integer programming and links to artificial intelligence
• Coupling ant colony systems with strong local searches
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• The orienteering problem
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• Algorithms for a stochastic selective travelling salesperson problem