Solving the probabilistic TSP with ant colony optimization

DOI10.1007/S10852-005-2585-ZMaRDI QIDQ1774631zbMATH OpenOpenAlexFDO

Authors Michael Guntsch, Jürgen Branke

Publication date 17 May 2005

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-005-2585-z

zbMATH Keywords

ant colony optimizationprobabilistic traveling salesperson problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1961987
• scientific article; zbMATH DE number 1818013
• Approximation performance of ant colony optimization for the \(\mathrm{TSP}(1,2)\) problem
• scientific article; zbMATH DE number 1487884
• A Priori Optimization of the Probabilistic Traveling Salesman Problem

Cites work

• A Priori Optimization
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
• Computational Approaches to Stochastic Vehicle Routing Problems
• Further results on the probabilistic traveling salesman problem
• scientific article; zbMATH DE number 1703864 (Why is no real title available?)
• scientific article; zbMATH DE number 1961987 (Why is no real title available?)
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms

Cited in

(17)

• A survey on metaheuristics for stochastic combinatorial optimization
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
• Coupling ant colony systems with strong local searches
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
• Approximation performance of ant colony optimization for the \(\mathrm{TSP}(1,2)\) problem
• scientific article; zbMATH DE number 1818013 (Why is no real title available?)
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
• Challenges and Advances in A Priori Routing
• scientific article; zbMATH DE number 1961987 (Why is no real title available?)
• Adaptive tunning of all parameters in a multi-swarm particle swarm optimization algorithm: an application to the probabilistic traveling salesman problem
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• GENI ants for the 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
• Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
• Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
• Estimation-based metaheuristics for the probabilistic traveling salesman problem

This page was built for publication: Solving the probabilistic TSP with ant colony optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774631)