Show simple item record

dc.contributor.authorFoxwell, Earl Brendan.en_US
dc.date.accessioned2010-01-28T15:55:25Z
dc.date.available2010-01-28T15:55:25Z
dc.date.issued2009-01-28T15:55:25Z
dc.identifier.urihttp://hdl.handle.net/10464/2866
dc.description.abstractThe 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.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectRing networks (Computer networks)en_US
dc.subjectMathematical optimization.en_US
dc.subjectParticles (Nuclear physics)en_US
dc.subjectSwarm intelligence.en_US
dc.titleParticle swarm optimization for two-connected networks with bounded ringsen_US
dc.typeElectronic Thesis or Dissertationen_US
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record