Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem

DOI10.1287/ijoc.1080.0276zbMath1243.90154WikidataQ56971938 ScholiaQ56971938MaRDI QIDQ2901040

Mauro Birattari, Thomas Stützle, Marco Dorigo, Prasanna Balaprakash

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/45dc9e15236b5da129da5295918ba83aa0a88271

zbMATH Keywords

suboptimal algorithms; stochastic combinatorial optimization; iterative improvement simulation

Mathematics Subject Classification ID

90C15: Stochastic programming

90C27: Combinatorial optimization

Related Items

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling, Recent trends in metaheuristics for stochastic combinatorial optimization, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, Estimation-based metaheuristics for the probabilistic traveling salesman problem, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem, Coupling ant colony systems with strong local searches, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, On the computational complexity of the probabilistic traveling salesman problem with deadlines

Uses Software

• MPFR