Optimization by simulated catalytic reaction: Application to graph bisection

Yong Hyuk Kim, Seokjoong Kang

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)2162-2176
Number of pages15
JournalKSII Transactions on Internet and Information Systems
Volume12
Issue number5
DOIs
Publication statusPublished - 2018 May 31

Fingerprint

Chemical reactions
Combinatorial optimization
Experiments

Keywords

  • graph bisection
  • optimization
  • Search
  • simulated catalytic reaction

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this

Optimization by simulated catalytic reaction : Application to graph bisection. / Kim, Yong Hyuk; Kang, Seokjoong.

In: KSII Transactions on Internet and Information Systems, Vol. 12, No. 5, 31.05.2018, p. 2162-2176.

Research output: Contribution to journalArticle

@article{c8ac5bcf28594711b3cac8c8c293c1fd,
title = "Optimization by simulated catalytic reaction: Application to graph bisection",
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.",
keywords = "graph bisection, optimization, Search, simulated catalytic reaction",
author = "Kim, {Yong Hyuk} and Seokjoong Kang",
year = "2018",
month = "5",
day = "31",
doi = "10.3837/tiis.2018.05.014",
language = "English",
volume = "12",
pages = "2162--2176",
journal = "KSII Transactions on Internet and Information Systems",
issn = "1976-7277",
publisher = "Korea Society of Internet Information",
number = "5",

}

TY - JOUR

T1 - Optimization by simulated catalytic reaction

T2 - Application to graph bisection

AU - Kim, Yong Hyuk

AU - Kang, Seokjoong

PY - 2018/5/31

Y1 - 2018/5/31

N2 - 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.

AB - 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.

KW - graph bisection

KW - optimization

KW - Search

KW - simulated catalytic reaction

UR - http://www.scopus.com/inward/record.url?scp=85047907398&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85047907398&partnerID=8YFLogxK

U2 - 10.3837/tiis.2018.05.014

DO - 10.3837/tiis.2018.05.014

M3 - Article

AN - SCOPUS:85047907398

VL - 12

SP - 2162

EP - 2176

JO - KSII Transactions on Internet and Information Systems

JF - KSII Transactions on Internet and Information Systems

SN - 1976-7277

IS - 5

ER -