A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
DOI10.1016/j.cor.2009.03.004zbMath1173.90515OpenAlexW2034027189MaRDI QIDQ1038278
Magdalene Marinaki, Yannis Marinakis
Publication date: 17 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.03.004
metaheuristicsparticle swarm optimizationprobabilistic traveling salesman problemexpanding neighborhood search-GRASP
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- 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
- MCPSO: a multi-swarm cooperative particle swarm optimizer
- A hybrid scatter search for the probabilistic traveling salesman problem
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- Solving the probabilistic TSP with ant colony optimization
- Greedy randomized adaptive search procedures
- Further results on the probabilistic traveling salesman problem
- Locating multiple optima using particle swarm optimization
- A review of particle swarm optimization. I: Background and development
- Aggregation for the probabilistic traveling salesman problem
- Expanding neighborhood GRASP for the traveling salesman problem
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
- Particle Swarm Optimization
- Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Tabu Search—Part I
- Tabu Search—Part II
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Computational Approaches to Stochastic Vehicle Routing Problems
- Computer Solutions of the Traveling Salesman Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem