Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.creatorM. F. Cardoso
dc.creatorR. L. Salcedo
dc.creatorS. Feyo de Azevedo
dc.creatorD. Barbosa
dc.description.abstractAn algorithm (M-SIMPSA) suitable for the optimization of mixed integer non-linear programming (MINLP) problems is presented. A recently proposed continuous non-linear solver (SIMPSA) is used to update the continuous parameters, and the Metropolis algorithm is used to update the complete solution vector of decision variables. The M-SIMPSA algorithm, which does not require feasible initial points or any problem decomposition, was tested with several functions published in the literature, and results were compared with those obtained with a robust adaptive random search method. For ill-conditioned problems, the proposed approach is shown to be more reliable and more efficient as regards the overcoming of difficulties associated with local optima and in the ability to reach feasibility. The results obtained reveal its adequacy for the optimization of MINLP problems encountered in chemical engineering practice. (C) 1997 Elsevier Science Ltd.
dc.subjectCiências da computação e da informação
dc.subjectComputer and information sciences
dc.titleA simulated annealing approach to the solution of MINLP problems
dc.typeArtigo em Revista Científica Internacional
dc.contributor.uportoFaculdade de Engenharia
dc.contributor.uportoInstituto de Ciências Biomédicas Abel Salazar
dc.subject.fosCiências exactas e naturais::Ciências da computação e da informação
dc.subject.fosNatural sciences::Computer and information sciences
Appears in Collections:FEUP - Artigo em Revista Científica Internacional
ICBAS - Artigo em Revista Científica Internacional

Files in This Item:
File Description SizeFormat 
  Restricted Access
Artigo original publicado1.16 MBAdobe PDF    Request a copy from the Author(s)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.