Particle swarm optimization for two-connected networks with bounded rings

摘要

The Two-Connected Network with Bounded Ring (2CNBR) problem is a network designproblem addressing the connection of servers to create a survivable network withlimited redirections in the event of failures. Particle Swarm Optimization (PSO) is astochastic population-based optimization technique modeled on the social behaviourof flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem.As PSO is originally designed to handle a continuous solution space, modificationof the algorithm was necessary in order to adapt it for such a highly constraineddiscrete combinatorial optimization problem. Presented are an indirect transcriptionscheme for applying PSO to such discrete optimization problems and an oscillatingmechanism for averting stagnation.