Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
DOI10.1287/IJOC.1080.0276zbMATH Open1243.90154OpenAlexW2171591902WikidataQ56971938 ScholiaQ56971938MaRDI QIDQ2901040FDOQ2901040
Authors: Mauro Birattari, Prasanna Balaprakash, Thomas Stützle, Marco Dorigo 
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
Recommendations
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Cited In (15)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment
- Recent trends in metaheuristics for stochastic combinatorial optimization
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- Coupling ant colony systems with strong local searches
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- The probabilistic minimum dominating set problem
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
Uses Software
This page was built for publication: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901040)
