Combining solutions of the optimum satisfiability problem using evolutionary tunneling

Simple item page
dc.contributor.authorda Silva, Rodrigo Ferreira
dc.contributor.authorHvattum, Lars Magnus
dc.contributor.authorGlover, Fred
dc.coverage.issue1cs
dc.coverage.volume26cs
dc.date.accessioned2020-09-01T07:01:25Z
dc.date.available2020-09-01T07:01:25Z
dc.date.issued2020-08-24cs
dc.description.abstractThe optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true. Existing literature has identified a tabu search heuristic as the best method to deal with hard instances of the problem. This paper combines the tabu search with a simple evolutionary heuristic based on the idea of tunneling between local optima. When combining a set of solutions, variables with common values in all solutions are identified and fixed. The remaining free variables in the problem may be decomposed into several independent subproblems, so that parts of the solutions combined can be extracted and combined in an improved solution. This solution can be further improved by applying the tabu search in an improvement stage. The value of the new heuristic is demonstrated in extensive computational experiments on both existing and new test instances.en
dc.formattextcs
dc.format.extent23-29cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationMendel. 2020 vol. 26, č. 1, s. 23-29. ISSN 1803-3814cs
dc.identifier.doi10.13164/mendel.2020.1.023en
dc.identifier.issn2571-3701
dc.identifier.issn1803-3814
dc.identifier.urihttp://hdl.handle.net/11012/195023
dc.language.isoencs
dc.publisherInstitute of Automation and Computer Science, Brno University of Technologycs
dc.relation.ispartofMendelcs
dc.relation.urihttps://mendel-journal.org/index.php/mendel/article/view/106cs
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International licenseen
dc.rights.accessopenAccessen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0en
dc.subjectzero-one integer programmingen
dc.subjectboolean optimizationen
dc.subjectmetaheuristicen
dc.subjecttabu searchen
dc.subjectadaptive memory programmingen
dc.subjectrecombination operatoren
dc.titleCombining solutions of the optimum satisfiability problem using evolutionary tunnelingen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
106-Article Text-218-1-10-20200826.pdf
Size:
541.23 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Vol. 26, No. 1