Zobrazeno 1 - 10
of 14
pro vyhledávání: '"V. P. Shylo"'
Publikováno v:
Cybernetics and Systems Analysis. 56:231-242
To solve multimodal optimization problems, a new niching genetic algorithm named tournament crowding genetic algorithm based on Gaussian mutation is proposed. A comparative analysis of this algorithm to other crowding algorithms and to parallel hill-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62606a066569671c953b329acae92d00
https://doi.org/10.1007/s10559-020-00239-4
https://doi.org/10.1007/s10559-020-00239-4
Publikováno v:
Cybernetics and Systems Analysis. 56:53-57
Two modifications of the repeated iterated tabu algorithm for solving the quadratic assignment problem (with and without kernel allocation technology) are proposed. These modifications are analyzed and compared with the best modern algorithms for sol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bc1ea6fb57902f4e5f044f12f6ff811
https://doi.org/10.1007/s10559-020-00219-8
https://doi.org/10.1007/s10559-020-00219-8
Autor:
S. V. Chupov, V. P. Shylo
Publikováno v:
Cybernetics and Systems Analysis. 55:677-682
This article briefly reviews software and hardware means of modern computer engineering that allow to construct efficient systems of parallel computing. Structural schemes are presented and the execution of combinations of parallel optimization algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89bdb44803ebcda293e033cf15ca6d8c
https://doi.org/10.1007/s10559-019-00177-w
https://doi.org/10.1007/s10559-019-00177-w
Autor:
V. P. Shylo, Ivan V. Sergienko
Publikováno v:
Cybernetics and Systems Analysis. 53:884-892
The kernel technology is proposed to solve discrete optimization problems. It forms solution kernel and allows efficient stochastic perturbations of this solution in iterative schemes. Comparative analysis of the two versions of the new algorithm for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2faadc2b166fe46ddce3e3795ad301f
https://doi.org/10.1007/s10559-017-9990-y
https://doi.org/10.1007/s10559-017-9990-y
Autor:
Ivan V. Sergienko, V. P. Shylo
Publikováno v:
Journal of Automation and Information Sciences. 48:15-24
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a496db53956172031a109cb571d0a51
https://doi.org/10.1615/jautomatinfscien.v48.i1.30
https://doi.org/10.1615/jautomatinfscien.v48.i1.30
Publikováno v:
Cybernetics and Systems Analysis. 51:16-24
This paper investigates the impact of communication between optimization algorithms running in parallel. In particular, we focus on the weighted maximum cut (WMAXCUT) problem and compare different communication strategies between teams of GES algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a077c3910567fa4c2be1d854fbd560c
https://doi.org/10.1007/s10559-015-9692-2
https://doi.org/10.1007/s10559-015-9692-2
Publikováno v:
Cybernetics and Systems Analysis. 48:563-567
A new algorithm based on the global equilibrium search (GES) is developed to solve the weighted max-cut problem and is compared with currently the best solution algorithms. The advantages of the GES algorithm both in the performance and in the possib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38db2c61916ae3580b34ac2e23c68414
https://doi.org/10.1007/s10559-012-9435-6
https://doi.org/10.1007/s10559-012-9435-6
Autor:
O. V. Shylo, V. P. Shylo
Publikováno v:
Cybernetics and Systems Analysis. 47:889-897
A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ab40f1401291d822bfc0beee2b0d7df
https://doi.org/10.1007/s10559-011-9368-5
https://doi.org/10.1007/s10559-011-9368-5
Autor:
O. V. Shylo, V. P. Shylo
Publikováno v:
Cybernetics and Systems Analysis. 46:744-754
The authors propose an approach to the solution of the maxcut problem. It is based on the global equilibrium search method, which is currently one of the most efficient discrete programming methods. The efficiency of the proposed algorithm is analyze
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dde3d44a3b68027d7aed9bbead4f31c9
https://doi.org/10.1007/s10559-010-9256-4
https://doi.org/10.1007/s10559-010-9256-4
Publikováno v:
Operations Research Letters. 36:434-438
In this note we investigate the performance of global equilibrium search based heuristics on the weighted MAX-SAT problem. Three variants of the approach are implemented and compared with other existing algorithms on publicly available benchmark inst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13e13fb7c8786dee8c6258bff1550553
https://doi.org/10.1016/j.orl.2007.11.007
https://doi.org/10.1016/j.orl.2007.11.007