Show simple item record

dc.contributor.authorBond, Ron
dc.date.accessioned2015-04-17T18:09:55Z
dc.date.available2015-04-17T18:09:55Z
dc.identifier.urihttp://hdl.handle.net/10464/6314
dc.description.abstractPopulation-based metaheuristics, such as particle swarm optimization (PSO), have been employed to solve many real-world optimization problems. Although it is of- ten sufficient to find a single solution to these problems, there does exist those cases where identifying multiple, diverse solutions can be beneficial or even required. Some of these problems are further complicated by a change in their objective function over time. This type of optimization is referred to as dynamic, multi-modal optimization. Algorithms which exploit multiple optima in a search space are identified as niching algorithms. Although numerous dynamic, niching algorithms have been developed, their performance is often measured solely on their ability to find a single, global optimum. Furthermore, the comparisons often use synthetic benchmarks whose landscape characteristics are generally limited and unknown. This thesis provides a landscape analysis of the dynamic benchmark functions commonly developed for multi-modal optimization. The benchmark analysis results reveal that the mechanisms responsible for dynamism in the current dynamic bench- marks do not significantly affect landscape features, thus suggesting a lack of representation for problems whose landscape features vary over time. This analysis is used in a comparison of current niching algorithms to identify the effects that specific landscape features have on niching performance. Two performance metrics are proposed to measure both the scalability and accuracy of the niching algorithms. The algorithm comparison results demonstrate the algorithms best suited for a variety of dynamic environments. This comparison also examines each of the algorithms in terms of their niching behaviours and analyzing the range and trade-off between scalability and accuracy when tuning the algorithms respective parameters. These results contribute to the understanding of current niching techniques as well as the problem features that ultimately dictate their success.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectParticle swarm optimizationen_US
dc.titleCharacterizing Dynamic Optimization Benchmarks for the Comparison of Multi-Modal Tracking Algorithmsen_US
dc.typeElectronic Thesis or Dissertationen
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
refterms.dateFOA2015-01-01T00:00:00Z


Files in this item

Thumbnail
Name:
Brock_Bond_Ron_2015.pdf
Size:
17.13Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record