Genetic Quantum Particle Swarm Optimization Algorithm for Solving Traveling Salesman Problems
From MaRDI portal
Publication:4982141
Recommendations
- A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem
- An improved particle swarm optimisation for solving generalised travelling salesman problem
- Crossover particle swarm optimization for the traveling salesman problem
- A comparative study on particle swarm optimization and genetic algorithms for traveling salesman problems
- An improved quantum genetic algorithm based on the theory of PSO
- Complex particle swarm optimization algorithm for solving travelling salesman problem
- Genetic algorithms for the traveling salesman problem
Cited in
(9)- An improved noise quantum annealing method for TSP
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem
- A comparative study on particle swarm optimization and genetic algorithms for traveling salesman problems
- Performance analysis of multi-scale quantum harmonic oscillator global optimization algorithm in combinatorial optimization problems
- Crossover particle swarm optimization for the traveling salesman problem
- Complex particle swarm optimization algorithm for solving travelling salesman problem
- Coordinating particle swarm optimization, ant colony optimization and K-Opt algorithm for traveling salesman problem
This page was built for publication: Genetic Quantum Particle Swarm Optimization Algorithm for Solving Traveling Salesman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982141)