Digital Repository

Particle swarm optimization for two-connected networks with bounded rings

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Foxwell, Earl Brendan. en_US
dc.date.accessioned 2010-01-28T15:55:25Z
dc.date.available 2010-01-28T15:55:25Z
dc.date.issued 2009-01-28T15:55:25Z
dc.identifier.uri http://hdl.handle.net/10464/2866
dc.description.abstract The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous solution space, modification of the algorithm was necessary in order to adapt it for such a highly constrained discrete combinatorial optimization problem. Presented are an indirect transcription scheme for applying PSO to such discrete optimization problems and an oscillating mechanism for averting stagnation. en_US
dc.language.iso eng en_US
dc.publisher Brock University en_US
dc.subject Ring networks (Computer networks) en_US
dc.subject Mathematical optimization. en_US
dc.subject Particles (Nuclear physics) en_US
dc.subject Swarm intelligence. en_US
dc.title Particle swarm optimization for two-connected networks with bounded rings en_US
dc.type Electronic Thesis or Dissertation en_US
dc.degree.name M.Sc. Computer Science en_US
dc.degree.level Masters en_US
dc.contributor.department Department of Computer Science en_US
dc.degree.discipline Faculty of Mathematics and Science en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search The Repository


Browse

My Account

Statistics


About the Digital Repository