Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitemtc-m21c.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier8JMKD3MGP3W34R/3TP8U8P
Repositorysid.inpe.br/mtc-m21c/2019/08.01.16.11
Last Update2019:08.01.16.11.57 (UTC) simone
Metadata Repositorysid.inpe.br/mtc-m21c/2019/08.01.16.11.57
Metadata Last Update2021:01.02.22.17.40 (UTC) administrator
Secondary KeyINPE--PRE/
Citation KeyBarbosaSenn:2019:HeOrRa
TitleA heuristic oriented racing algorithm for the fine-tuning of metaheuristics
Year2019
Access Date2024, May 19
Secondary TypePRE CI
Number of Files1
Size130 KiB
2. Context
Author1 Barbosa, Eduardo Batista de Moraes
2 Senne, Edson L. F.
Group1 DIDOP-CGCPT-INPE-MCTIC-GOV-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais (INPE)
2 Universidade Estadual Paulista (UNESP)
Author e-Mail Address1 eduardo.barbosa@inpe.br
2 edson.senne@unesp.br
Conference NameMetaheuristics International Conference
Conference LocationCartagena, Colombia
Date28-31 July
Book TitleProceedings
History (UTC)2019-08-01 16:12:09 :: simone -> administrator :: 2019
2021-01-02 22:17:40 :: administrator -> simone :: 2019
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
AbstractThe metaheuristics have become a powerful tool to solve real-world optimization problems. Its ease adaptability, usually demands effort to correctly define its components (e.g.: problem representation, neighborhood structure, etc.) and parameters to achieve their best performance. Thus, this paper aims to present an approach on the fine-tuning of metaheuristics combining Design of Experiments and Racing algorithms. The key idea is a heuristic method, which explores a search space of parameters looking for candidate configurations near of a promising alternative and consistently finds the good ones. To confirm this approach, we present a case study for fine-tuning a VNS metaheuristic on the classical Traveling Salesman Problem, and compare its results against a well established racing method. In general, our approach proved to be effective in terms of the overall time of the tuning process.
AreaMET
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > DIDOP > A heuristic oriented...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 01/08/2019 13:11 1.0 KiB 
4. Conditions of access and use
data URLhttp://mtc-m21c.sid.inpe.br/ibi/8JMKD3MGP3W34R/3TP8U8P
zipped data URLhttp://mtc-m21c.sid.inpe.br/zip/8JMKD3MGP3W34R/3TP8U8P
Languageen
Target FileBarbosa_heuristic.pdf
User Groupsimone
Reader Groupadministrator
simone
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/43SQKNE
Citing Item Listsid.inpe.br/bibdigital/2021/01.02.22.14 2
Host Collectionurlib.net/www/2017/11.22.19.04
6. Notes
Empty Fieldsarchivingpolicy archivist callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi e-mailaddress edition editor format isbn issn keywords label lineage mark mirrorrepository nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project publisher publisheraddress readpermission resumeid rightsholder schedulinginformation secondarydate secondarymark serieseditor session shorttitle sponsor subject tertiarymark tertiarytype type url volume
7. Description control
e-Mail (login)simone
update 


Close