Complex particle swarm optimization algorithm for solving travelling salesman problem

MaRDI QIDQ3610680zbMATH OpenFDO

Authors Yuanbin Mo, Shangxu Hu, De-Zhao Chen

Publication date 6 March 2009

zbMATH Keywords

method of complexparticle swarm optimizationsolution sequence operationtravelling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• Crossover particle swarm optimization for the traveling salesman problem
• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Coordinating particle swarm optimization, ant colony optimization and K-Opt algorithm for traveling salesman problem
• Genetic Quantum Particle Swarm Optimization Algorithm for Solving Traveling Salesman Problems
• Dynamic neighborhood particle swarm optimization for TSP

Cited in

(7)

• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Application of a new acceleration particle swarm optimization for solving multiple traveling salesman problems
• scientific article; zbMATH DE number 5927355 (Why is no real title available?)
• Crossover particle swarm optimization for the traveling salesman problem
• An improved particle swarm optimisation for solving generalised travelling salesman problem
• Genetic Quantum Particle Swarm Optimization Algorithm for Solving Traveling Salesman Problems
• Coordinating particle swarm optimization, ant colony optimization and K-Opt algorithm for traveling salesman problem

This page was built for publication: Complex particle swarm optimization algorithm for solving travelling salesman problem

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