The influence of problem specific neighborhood structures in metaheuristics performance

Detalhes bibliográficos
Autor(a) principal: Santos, A. S.
Data de Publicação: 2018
Outros Autores: Madureira, A. M., Varela, M.L.R.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/1822/62957
Resumo: Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to approach complex computational problems, such as the Travelling Salesman Problem (TSP), but there is lack of information on the parameterization procedure and the appropriate parameters to improve MHs' performance. In this paper the parameterization procedure of Simulated Annealing (SA) and Discrete Artificial Bee Colony (DABC) is addressed, with a focus on the Neighborhood Structure (NS). Numerous NS have been proposed for specific problems, which seem to indicate that the NS is a special parameter, whose optimization is independent of other parameters. The performance of eight NS was examined with SA and DABC under two optimization constraints, regarding computational time variation, to determine if there is one appropriate NS for the TSP problem, independent of the rest of the parameters of the optimization procedure. The computational study carried out for comparing the evaluation of the NS, including a statistical analysis, demonstrated a nonproportional increase in the performance of DABC with some NS. For SA the improvement of the solutions appeared to be more uniform with an almost nonexistent variance in improvement.
id RCAP_58716c455fb14f0b3a501ca68974b893
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/62957
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling The influence of problem specific neighborhood structures in metaheuristics performanceScience & TechnologyMetaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to approach complex computational problems, such as the Travelling Salesman Problem (TSP), but there is lack of information on the parameterization procedure and the appropriate parameters to improve MHs' performance. In this paper the parameterization procedure of Simulated Annealing (SA) and Discrete Artificial Bee Colony (DABC) is addressed, with a focus on the Neighborhood Structure (NS). Numerous NS have been proposed for specific problems, which seem to indicate that the NS is a special parameter, whose optimization is independent of other parameters. The performance of eight NS was examined with SA and DABC under two optimization constraints, regarding computational time variation, to determine if there is one appropriate NS for the TSP problem, independent of the rest of the parameters of the optimization procedure. The computational study carried out for comparing the evaluation of the NS, including a statistical analysis, demonstrated a nonproportional increase in the performance of DABC with some NS. For SA the improvement of the solutions appeared to be more uniform with an almost nonexistent variance in improvement.This work is supported by FEDER Funds through the "Programa Operacional Factores de Competitividade (COMPETE)" and by National Funds through FCT "Fundação para a Ciência e a Tecnologia" under the Projects FCOMP-01-0124-FEDER-PEst-OE/EEI/UI0760/2011, PEst-OE/EEI/UI0760/2014, and PEst2015-2020.Hindawi LimitedUniversidade do MinhoSantos, A. S.Madureira, A. M.Varela, M.L.R.20182018-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/62957eng2314-46292314-478510.1155/2018/8072621info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-05-11T04:44:14Zoai:repositorium.sdum.uminho.pt:1822/62957Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-05-11T04:44:14Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv The influence of problem specific neighborhood structures in metaheuristics performance
title The influence of problem specific neighborhood structures in metaheuristics performance
spellingShingle The influence of problem specific neighborhood structures in metaheuristics performance
Santos, A. S.
Science & Technology
title_short The influence of problem specific neighborhood structures in metaheuristics performance
title_full The influence of problem specific neighborhood structures in metaheuristics performance
title_fullStr The influence of problem specific neighborhood structures in metaheuristics performance
title_full_unstemmed The influence of problem specific neighborhood structures in metaheuristics performance
title_sort The influence of problem specific neighborhood structures in metaheuristics performance
author Santos, A. S.
author_facet Santos, A. S.
Madureira, A. M.
Varela, M.L.R.
author_role author
author2 Madureira, A. M.
Varela, M.L.R.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Santos, A. S.
Madureira, A. M.
Varela, M.L.R.
dc.subject.por.fl_str_mv Science & Technology
topic Science & Technology
description Metaheuristics (MH) aptitude to move past local optimums makes them an attractive technique to approach complex computational problems, such as the Travelling Salesman Problem (TSP), but there is lack of information on the parameterization procedure and the appropriate parameters to improve MHs' performance. In this paper the parameterization procedure of Simulated Annealing (SA) and Discrete Artificial Bee Colony (DABC) is addressed, with a focus on the Neighborhood Structure (NS). Numerous NS have been proposed for specific problems, which seem to indicate that the NS is a special parameter, whose optimization is independent of other parameters. The performance of eight NS was examined with SA and DABC under two optimization constraints, regarding computational time variation, to determine if there is one appropriate NS for the TSP problem, independent of the rest of the parameters of the optimization procedure. The computational study carried out for comparing the evaluation of the NS, including a statistical analysis, demonstrated a nonproportional increase in the performance of DABC with some NS. For SA the improvement of the solutions appeared to be more uniform with an almost nonexistent variance in improvement.
publishDate 2018
dc.date.none.fl_str_mv 2018
2018-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1822/62957
url http://hdl.handle.net/1822/62957
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 2314-4629
2314-4785
10.1155/2018/8072621
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Hindawi Limited
publisher.none.fl_str_mv Hindawi Limited
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv mluisa.alvim@gmail.com
_version_ 1817544403038765056