Title of article
Black boxscattersearchforgeneralclassesofbinaryoptimizationproblems
Author/Authors
Francisco Gorta´ zar ، نويسنده , , AbrahamDuarte، نويسنده , , ManuelLaguna d، نويسنده , , RafaelMart?´ ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
1977
To page
1986
Abstract
The purposeofthispaperistoapplythescattersearchmethodologytogeneralclassesofbinary
problems.Wefocusonoptimizationproblemsforwhichthesolutionsarerepresentedasbinaryvectors
and thatmayormaynotincludeconstraints.Binaryproblemsariseinavarietyofsettings,including
engineeringdesignandstatisticalmechanics(e.g.,thespinglassproblem).Adistinctionismade
betweentwosetsofgeneralconstrainttypesthatarehandleddirectlybythesolverandother
constraintsthatareaddressedviapenaltyfunctions.Inbothcases,however,theheuristictreatsthe
objectivefunctionevaluationasablackbox.Weperformcomputationalexperimentswithfourwell-
known binaryoptimizationproblemstostudytheefficiency(speed)andeffectiveness(solutionquality)
of theproposedmethod.Comparisonsaremadeagainstbothcommercialsoftwareandspecialized
proceduresonasetof376instances.Wechosecommercialsoftwarethatissimilarinnaturetothe
proposedprocedure,namely,ittreatstheobjectivefunctionasablackboxandthesearchisbasedon
evolutionaryoptimizationtechniques.
Keywords
Optimization , Hard optimization problems , Metaheuristics
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927803
Link To Document