Discrete particle swarm optimization, illustrated by the traveling salesman problem.

*(English)* Zbl 1139.90415
Onwubolu, Godfrey C. (ed.) et al., New optimization techniques in engineering. Berlin: Springer (ISBN 3-540-20167-X/hbk). Studies in Fuzziness and Soft Computing 141, 219-239 (2004).

Introduction: The classical particle swarm optimization (PSO) is a powerful method to find the minimum of a numerical function, on a continuous definition domain. As some binary versions have already successfully been used, it seems quite natural to try to define a framework for a discrete PSO. In order to better understand both the power and the limits of this approach, we examine in detail how it can be used to solve the well-known traveling salesman problem, which is in principle very “bad” for this kind of optimization heuristic. Results show Discrete PSO is certainly not as “powerful as some specific algorithms, but, on the other hand, it can easily be modified for any discrete/combinatorial problem for which we have no good specialized algorithm.

##### MSC:

90C27 | Combinatorial optimization |

90C59 | Approximation methods and heuristics |