Solving Order/Degree Problems by Using EDA-GK with a Novel Sampling Method-Reference-Cited by-同舟云学术

Solving Order/Degree Problems by Using EDA-GK with a Novel Sampling Method

Published:2018-03-20 Issue:2 Volume:22 Page:236-241
ISSN:1883-8014
Container-title:Journal of Advanced Computational Intelligence and Intelligent Informatics
language:en
Short-container-title:JACIII

Author:

Hasegawa Ryoichi, ,Handa Hisashi

Abstract

The Estimation of Distribution Algorithms with Graph Kernels called EDA-GK is an extension of the Estimation of Distribution Algorithms that can work with graph-related problems. Individuals of the EDA-GK are represented by graphs. In this paper, the EDA-GK is applied to solve for the Order/Degree problems, which are an NP-hard problems and are a benchmark problem in graph theory studies. Moreover, we incorporate a new sampling method for generating offspring. Experimental results on several problem instances of Order/Degree problems show the effectiveness of the EDA-GK.

Publisher

Fuji Technology Press Ltd.

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Human-Computer Interaction

Reference13 articles.

1. H. Handa, “Use of graph kernels in Estimation of Distribution Algorithms,” Proc. of 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1-6, 2012.

2. K. Maezawa and H. Handa, ”Estimation of Distribution Algorithms with Graph Kernels for Graphs with Node Types,” Proc. 20th Asia Pacific Symposium on Intelligent and Evolutionary Systems, pp. 251-261, 2016.

3. P. Larrañaga and J. A. Lozano, “Estimation of Distribution Algorithms,” Kluwer Academic Publishers, 2003.

4. T. Kitasuka and M. Iida, “A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problems,” 2016 10th IEEE/ACM Int. Symposium on Networks-on-Chip, 2016.

5. Graph Golf, http://research.nii.ac.jp/graphgolf/ [accessed May 1, 2017]