Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/83700
Full metadata record
DC FieldValueLanguage
dc.creatorR. M. A. Silva
dc.creatorM. G. C. Resende
dc.creatorP. M. Pardalos
dc.creatorJ. F. Gonçalves
dc.date.accessioned2022-09-12T02:45:17Z-
dc.date.available2022-09-12T02:45:17Z-
dc.date.issued2012
dc.identifier.othersigarra:51592
dc.identifier.urihttps://hdl.handle.net/10216/83700-
dc.description.abstractGlobal optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a biased random-key genetic algorithm for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate its effectiveness on the robot kinematics problem, a challenging problem according to [7].
dc.language.isoeng
dc.relation.ispartofGOW 2012: Proceedings of Global Optimization Workshop
dc.rightsopenAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc/4.0/
dc.subjectEstudos de gestão, Economia e gestão
dc.subjectManagement studies, Economics and Business
dc.titleBiased random-key genetic algorithm for bound-constrained global optimization
dc.typeArtigo em Livro de Atas de Conferência Internacional
dc.contributor.uportoFaculdade de Economia
dc.subject.fosCiências sociais::Economia e gestão
dc.subject.fosSocial sciences::Economics and Business
Appears in Collections:FEP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:
File Description SizeFormat 
51592.pdf87.35 kBAdobe PDFThumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons