Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems
Thesis (MSc)--Stellenbosch University, 2026.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Stellenbosch : Stellenbosch University
2026
|
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613987402678272 |
|---|---|
| access_status_str | Open Access |
| author | Steyn, Gary Jared |
| author2 | Engelbrecht, A. P. |
| author_browse | Engelbrecht, A. P. Steyn, Gary Jared |
| author_facet | Engelbrecht, A. P. Steyn, Gary Jared |
| author_sort | Steyn, Gary Jared |
| collection | Thesis |
| dc_rights_str_mv | Stellenbosch University |
| description | Thesis (MSc)--Stellenbosch University, 2026. |
| format | Thesis |
| id | oai:scholar.sun.ac.za:10019.1/135798 |
| institution | Stellenbosch University (South Africa) |
| language | English |
| last_indexed | 2026-06-10T12:44:52.743Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from SUNScholar — Stellenbosch University Repository |
| publishDate | 2026 |
| publishDateRange | 2026 |
| publishDateSort | 2026 |
| publisher | Stellenbosch : Stellenbosch University |
| publisherStr | Stellenbosch : Stellenbosch University |
| record_format | dspace |
| source_str | SUNScholar — Stellenbosch University Repository |
| spelling | oai:scholar.sun.ac.za:10019.1/135798 Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems Steyn, Gary Jared Engelbrecht, A. P. Stellenbosch University. Faculty of Science. Dept. of Computer Science. Thesis (MSc)--Stellenbosch University, 2026. Steyn, G. J. 2026. Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems. Unpublished masters thesis. Stellenbosch: Stellenbosch University [online]. Available: https://scholar.sun.ac.za/items/a4b337b1-79e1-49f5-8807-e7742851b073 Many real-world optimisation problems are inherently dynamic, defined by changes in their underlying properties over time. Real-world problems also frequently require optimisation over discrete-valued decision variables. However, the solution of problems that are simultaneously dynamic and combinatorial remains a significant challenge, as limited prior research has addressed this intersection of characteristics. Most studies on dynamic optimisation focus on problems formulated with real-valued variables, where continuous population-based metaheuristics have emerged as the predominant class of solution methods. This thesis investigates the application of set-based particle swarm optimisation (SBPSO) to dynamic combinatorial optimisation problems and dynamic multivariate regression problems, which involve bilevel optimisation over both continuous and discrete domains. After a review of relevant optimisation theory and related literature, the thesis first investigates strategies that improve the computational efficiency of SBPSO for stationary multivariate polynomial regression. This initial study establishes a foundation for the practical extension of SBPSO to dynamic regression problems and for the integration of the algorithm into more sophisticated modelling frameworks. Theoretical and empirical analyses of the swarm behaviour of SBPSO are conducted and demonstrate that the swarm fails to converge in most practical scenarios. Although convergence generally proves detrimental in dynamic environments, the findings from these analyses are used to inform the design of adaptive mechanisms that continuously adapt the behaviour of the swarm based on the immediate state of the search process. The devised adaptive strategies are first evaluated on stationary multivariate polynomial regression problems. The best-performing adaptive SBPSO variant identified in this preliminary study is subsequently extended to detect and respond to changes in dynamic environments. This modified SBPSO variant is then evaluated against alternative population-based algorithms on two types of dynamic combinatorial optimisation problems, namely dynamic multidimensional knapsack and dynamic bit-matching problems. Additionally, three distinct SBPSO variants are evaluated across several dynamic multivariate regression problems. The results indicate that SBPSO generally outperforms the alternative population-based algorithms on the evaluated combinatorial problems, while the findings for the regression problems validate the contribution of the incorporated adaptive strategies to the performance of the algorithm. Masters 2026-04-10T10:43:08Z 2026-04-10T10:43:08Z 2026-03 Thesis https://scholar.sun.ac.za/handle/10019.1/135798 en Stellenbosch University 220 pages application/pdf Stellenbosch : Stellenbosch University |
| spellingShingle | Steyn, Gary Jared Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems |
| title | Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems |
| title_full | Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems |
| title_fullStr | Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems |
| title_full_unstemmed | Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems |
| title_short | Set-based Particle Swarm Optimisation for Dynamic Optimisation Problems |
| title_sort | set based particle swarm optimisation for dynamic optimisation problems |
| url | https://scholar.sun.ac.za/handle/10019.1/135798 |
| work_keys_str_mv | AT steyngaryjared setbasedparticleswarmoptimisationfordynamicoptimisationproblems |