Characterizing the performance of adaptive swarm-based simulated annealing algorithm
Swarm-based simulated annealing (SBSA) is a hybrid algorithm based from simulated annealing with the incorporation of swarm intelligence to resolve the problem of slow convergence in obtaining the optimal solutions. This study focuses on the characterization of algorithm by adjusting the parameters...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2009
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/9125 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-9770 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-97702022-11-10T08:06:03Z Characterizing the performance of adaptive swarm-based simulated annealing algorithm Ligon, Paolo Gabriel C. Luna, Eduardo B., III Siccion, Ray Anthony A. Swarm-based simulated annealing (SBSA) is a hybrid algorithm based from simulated annealing with the incorporation of swarm intelligence to resolve the problem of slow convergence in obtaining the optimal solutions. This study focuses on the characterization of algorithm by adjusting the parameters which affect its performance in terms of accuracy, consistency, and computational efficiency. The parameters which affect the performance of the algorithm were determined by solving eleven (11) test problems with different number of variables, constraints, and mathematical operators. The parameters that were varied were the swarm size, outer loop iteration, adaptive cooling coefficient, and step size, which were further characterized by assigning low and high level values in a two-level factorial experimental design. A configuration which has a higher parameter value of swarm size and number of iterations and a lower parameter value of step size and adaptive cooling coefficient was found to produce near-optimal and consistent solutions in test problems with small number of variables, constraints, and mathematical operators. The solutions of test problems were obtained at the low level value of outer loop iteration. However, increasing the number of outer loop iterations can increase the chance of finding the global optima. Increasing the penalty function and swarm size can increase the probability of exhibiting near-optimal solution for large-scale test problems. SBSA program is not recommended to be used for large-scale test problems because it produced inaccurate and inconsistent data based from the results of the study. 2009-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/9125 Bachelor's Theses English Animo Repository Swarm intelligence Simulated annealing (Mathematics) |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
language |
English |
topic |
Swarm intelligence Simulated annealing (Mathematics) |
spellingShingle |
Swarm intelligence Simulated annealing (Mathematics) Ligon, Paolo Gabriel C. Luna, Eduardo B., III Siccion, Ray Anthony A. Characterizing the performance of adaptive swarm-based simulated annealing algorithm |
description |
Swarm-based simulated annealing (SBSA) is a hybrid algorithm based from simulated annealing with the incorporation of swarm intelligence to resolve the problem of slow convergence in obtaining the optimal solutions. This study focuses on the characterization of algorithm by adjusting the parameters which affect its performance in terms of accuracy, consistency, and computational efficiency. The parameters which affect the performance of the algorithm were determined by solving eleven (11) test problems with different number of variables, constraints, and mathematical operators. The parameters that were varied were the swarm size, outer loop iteration, adaptive cooling coefficient, and step size, which were further characterized by assigning low and high level values in a two-level factorial experimental design. A configuration which has a higher parameter value of swarm size and number of iterations and a lower parameter value of step size and adaptive cooling coefficient was found to produce near-optimal and consistent solutions in test problems with small number of variables, constraints, and mathematical operators. The solutions of test problems were obtained at the low level value of outer loop iteration. However, increasing the number of outer loop iterations can increase the chance of finding the global optima. Increasing the penalty function and swarm size can increase the probability of exhibiting near-optimal solution for large-scale test problems. SBSA program is not recommended to be used for large-scale test problems because it produced inaccurate and inconsistent data based from the results of the study. |
format |
text |
author |
Ligon, Paolo Gabriel C. Luna, Eduardo B., III Siccion, Ray Anthony A. |
author_facet |
Ligon, Paolo Gabriel C. Luna, Eduardo B., III Siccion, Ray Anthony A. |
author_sort |
Ligon, Paolo Gabriel C. |
title |
Characterizing the performance of adaptive swarm-based simulated annealing algorithm |
title_short |
Characterizing the performance of adaptive swarm-based simulated annealing algorithm |
title_full |
Characterizing the performance of adaptive swarm-based simulated annealing algorithm |
title_fullStr |
Characterizing the performance of adaptive swarm-based simulated annealing algorithm |
title_full_unstemmed |
Characterizing the performance of adaptive swarm-based simulated annealing algorithm |
title_sort |
characterizing the performance of adaptive swarm-based simulated annealing algorithm |
publisher |
Animo Repository |
publishDate |
2009 |
url |
https://animorepository.dlsu.edu.ph/etd_bachelors/9125 |
_version_ |
1749181787591933952 |