Solving the probabilistic TSP with ant colony optimization

DOI10.1007/S10852-005-2585-ZzbMath1079.90169OpenAlexW4254560958MaRDI QIDQ1774631

Michael Guntsch, Juergen 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

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

Related Items (13)

Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ Coupling ant colony systems with strong local searches ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous 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 ⋮ Challenges and Advances in A Priori Routing ⋮ Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem ⋮ Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Further results on the probabilistic traveling salesman problem
• 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
• A Priori Optimization

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