Name
Abstract | ||
|---|---|---|
Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.3837/tiis.2018.05.014 | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS |
Keywords | Field | DocType |
Search,optimization,simulated catalytic reaction,graph bisection | Catalysis,Computer science,Parallel computing,Graph bisection,Distributed computing | Journal |
Volume | Issue | ISSN |
12 | 5 | 1976-7277 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yong-Hyuk Kim | 1 | 355 | 40.27 |
| Seokjoong Kang | 2 | 36 | 4.96 |