Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem

DOI10.1016/j.ejor.2008.11.027zbMath1176.90479OpenAlexW2148127689WikidataQ56971873 ScholiaQ56971873MaRDI QIDQ1042104

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

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.11.027

zbMATH Keywords

heuristicsimportance samplingcombinatorial optimizationmetaheuristicsprobabilistic traveling salesman problemiterative improvement algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling, Coupling ant colony systems with strong local searches, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, Recent trends in metaheuristics for stochastic combinatorial optimization, Estimation-based metaheuristics for the probabilistic traveling salesman problem, A survey on metaheuristics for stochastic combinatorial optimization, Dynamic vehicle routing with time windows in theory and practice, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers

Uses Software

• MPFR
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Simulated annealing for discrete optimization with estimation
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
• Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
• MPFR
• 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 Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
• Variable-sample methods for stochastic optimization
• A combined procedure for optimization via simulation
• A Priori Optimization