hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2003.03.06

An Evolutionary Framework for 3-SAT Problems

István Borgulya

Puni tekst: engleski, pdf (156 KB) str. 185-191 preuzimanja: 645* citiraj
APA 6th Edition
Borgulya, I. (2003). An Evolutionary Framework for 3-SAT Problems. Journal of computing and information technology, 11 (3), 185-191. https://doi.org/10.2498/cit.2003.03.06
MLA 8th Edition
Borgulya, István. "An Evolutionary Framework for 3-SAT Problems." Journal of computing and information technology, vol. 11, br. 3, 2003, str. 185-191. https://doi.org/10.2498/cit.2003.03.06. Citirano 20.02.2020.
Chicago 17th Edition
Borgulya, István. "An Evolutionary Framework for 3-SAT Problems." Journal of computing and information technology 11, br. 3 (2003): 185-191. https://doi.org/10.2498/cit.2003.03.06
Harvard
Borgulya, I. (2003). 'An Evolutionary Framework for 3-SAT Problems', Journal of computing and information technology, 11(3), str. 185-191. https://doi.org/10.2498/cit.2003.03.06
Vancouver
Borgulya I. An Evolutionary Framework for 3-SAT Problems. Journal of computing and information technology [Internet]. 2003 [pristupljeno 20.02.2020.];11(3):185-191. https://doi.org/10.2498/cit.2003.03.06
IEEE
I. Borgulya, "An Evolutionary Framework for 3-SAT Problems", Journal of computing and information technology, vol.11, br. 3, str. 185-191, 2003. [Online]. https://doi.org/10.2498/cit.2003.03.06

Sažetak
In this paper we present a new evolutionary framework for 3-SAT. This method can be divided into three stages, where each stage is an evolutionary algorithm. The first stage improves the quality of the initial population. The second stage improves the speed of the algorithm periodically generating new solutions. The 3rd stage is a hybrid evolutionary algorithm, which improves the solutions with a local search. The key points of our algorithm are the evolutionary framework and the mutation operation that form a concatenated, complex neighborhood structure, “a variable neighborhood descent”. We tested our algorithm on some benchmark problems. Comparing the results with other heuristic methods, we can conclude that our algorithm belongs to the best methods of this problem scope.

Hrčak ID: 44745

URI
https://hrcak.srce.hr/44745

Posjeta: 771 *