Application of a new acceleration particle swarm optimization for solving multiple traveling salesman problems

DOI10.15983/J.CNKI.JSNU.2015.06.263MaRDI QIDQ2993077zbMATH OpenFDO

Authors Ning Qiang, Fengju Kang

Publication date 10 August 2016

zbMATH Keywords

particle swarm optimizationcoding methodlearning strategymultiple traveling salesman problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Particle swarm optimization-based algorithms for TSP and generalized TSP
• Crossover particle swarm optimization for the traveling salesman problem
• Complex particle swarm optimization algorithm for solving travelling salesman problem
• Improved partheno-genetic algorithm for solving addressable multiple traveling salesman problem
• scientific article; zbMATH DE number 6719635

Cited in

(1)

• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem

This page was built for publication: Application of a new acceleration particle swarm optimization for solving multiple traveling salesman problems

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