Estimation-based metaheuristics for the probabilistic traveling salesman problem
From MaRDI portal
(Redirected from Publication:976010)
Recommendations
- Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
- scientific article; zbMATH DE number 1818013
- 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
Cites work
- scientific article; zbMATH DE number 3841285 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1961987 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 5582828 (Why is no real title available?)
- A Priori Optimization
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- A hybrid scatter search for the probabilistic traveling salesman problem
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Aggregation for the probabilistic traveling salesman problem
- Ant colony optimization.
- Challenges and Advances in A Priori Routing
- Diversified local search strategy under scatter search framework 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
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- MPFR
- Simulated annealing for noisy cost functions
- Solving the probabilistic TSP with ant colony optimization
- Stochastic Algorithms: Foundations and Applications
- Stochastic local search. Foundations and applications.
- The sample average approximation method for stochastic discrete optimization
- Towards a theory of practice in metaheuristics design: A machine learning perspective
- Tuning metaheuristics. A machine learning Perspective
Cited in
(13)- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- The probabilistic minimum dominating set problem
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- Putting continuous metaheuristics to work in binary search spaces
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- A survey on metaheuristics for stochastic combinatorial optimization
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Recent trends in metaheuristics for stochastic combinatorial optimization
- Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
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)
