Loading...
Please wait, while we are loading the content...
Similar Documents
Particle swarm optimization for two-connected networks with bounded rings
| Content Provider | Semantic Scholar |
|---|---|
| Author | Foxwell, Earl B. |
| Copyright Year | 2009 |
| 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://dr.library.brocku.ca/bitstream/handle/10464/2866/Brock_Foxwell_Earl_2009.pdf?isAllowed=y&sequence=1 |
| Alternate Webpage(s) | https://dr.library.brocku.ca/bitstream/handle/10464/2866/Brock_Foxwell_Earl_2009.pdf?sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
