Estimation-based metaheuristics for the probabilistic traveling salesman problem
From MaRDI portal
Publication:976010
DOI10.1016/j.cor.2009.12.005zbMath1188.90208OpenAlexW2167247544WikidataQ56971837 ScholiaQ56971837MaRDI QIDQ976010
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)
Related Items
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling, Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands, The probabilistic minimum dominating set problem, On the computational complexity of the probabilistic traveling salesman problem with deadlines, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, Recent trends in metaheuristics for stochastic combinatorial optimization, Putting continuous metaheuristics to work in binary search spaces, A survey on metaheuristics for stochastic combinatorial optimization, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Uses Software
Cites Work
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- A hybrid scatter search for the probabilistic traveling salesman problem
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- Tuning metaheuristics. A machine learning Perspective
- 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
- Solving the probabilistic TSP with ant colony optimization
- Simulated annealing for noisy cost functions
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- Aggregation for the probabilistic traveling salesman problem
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
- Towards a theory of practice in metaheuristics design: A machine learning perspective
- MPFR
- Challenges and Advances in A Priori Routing
- 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 Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A Priori Optimization
- Stochastic Algorithms: Foundations and Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
