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.
|Number of pages
|KSII Transactions on Internet and Information Systems
|Published - 2018 May 31
Bibliographical noteFunding Information:
The present research has been conducted by the Research Grant of Kwangwoon University in 2017. This research was supported by a grant [KCG-01-2017-05] through the Disaster and Safety Management Institute funded by Korea Coast Guard of Korean government, and by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. 2015R1D1A1A01060105).
© 2018 KSII.
- graph bisection
- simulated catalytic reaction
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications