A Tabu search algorithm for the probabilistic orienteering problem
type: Item
instance of: scholarly article
title: A Tabu search algorithm for the probabilistic orienteering problem
author: Xiaochen Chou
author: Luca Maria Gambardella
author: Roberto Montemanni
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350511
zbMATH Keywords: probabilistic orienteering problem
zbMATH Keywords: metaheuristic algorithms
zbMATH Keywords: Tabu search
zbMATH Keywords: Monte Carlo sampling
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105107
OpenAlex ID: W3090402613
cites work: The clustered orienteering problem
cites work: The probabilistic orienteering problem
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: The orienteering problem with stochastic travel and service times
cites work: A fast and effective heuristic for the orienteering problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Coupling ant colony systems with strong local searches
cites work: Q4540081
cites work: Future paths for integer programming and links to artificial intelligence
cites work: The orienteering problem
cites work: Algorithms to solve the orienteering problem: A comparison
cites work: Optimization by Simulated Annealing
cites work: The selective travelling salesman problem
cites work: Q2956989
cites work: An Optimal Algorithm for the Orienteering Tour Problem
cites work: A TABU search heuristic for the team orienteering problem
cites work: Algorithms for a stochastic selective travelling salesperson problem
cites work: Iterated local search for the team orienteering problem with time windows
cites work: The orienteering problem: a survey
cites work: Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
cites work: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
DOI: 10.1016/J.COR.2020.105107
description: scientific article; zbMATH DE number 7350511