Estimation-based metaheuristics for the probabilistic traveling salesman problem
DOI10.1016/J.COR.2009.12.005zbMATH Open1188.90208DBLPjournals/cor/BalaprakashBSD10OpenAlexW2167247544WikidataQ56971837 ScholiaQ56971837MaRDI QIDQ976010FDOQ976010
Mauro Birattari, Marco Dorigo, Thomas Stützle, Prasanna Balaprakash
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.12.005
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The sample average approximation method for stochastic discrete optimization
- MPFR
- Title not available (Why is that?)
- Tuning metaheuristics. A machine learning Perspective
- Title not available (Why is that?)
- Challenges and Advances in A Priori Routing
- A Priori Optimization
- Simulated annealing for noisy cost functions
- Stochastic Algorithms: Foundations and Applications
- Title not available (Why is that?)
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Solving the probabilistic TSP with ant colony optimization
- Aggregation for the probabilistic traveling salesman problem
- Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Fast Algorithms for Geometric Traveling Salesman Problems
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Title not available (Why is that?)
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- A hybrid scatter search for the probabilistic traveling salesman problem
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
- Title not available (Why is that?)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- Towards a theory of practice in metaheuristics design: A machine learning perspective
Cited In (11)
- 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
- Recent trends in metaheuristics for stochastic combinatorial optimization
- Putting continuous metaheuristics to work in binary search spaces
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- A survey on metaheuristics for stochastic combinatorial optimization
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- The probabilistic minimum dominating set problem
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- 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
Recommendations
- Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem 👍 👎
- Title not available (Why is that?) 👍 👎
- Further results on the probabilistic traveling salesman problem 👍 👎
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem 👍 👎
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem 👍 👎
This page was built for publication: Estimation-based metaheuristics for the probabilistic traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976010)