Solving graph coloring problem by fuzzy clustering-based genetic algorithm

Young Seol Lee; Sung Bae Cho

doi:10.1007/978-3-642-34859-4_35

Solving graph coloring problem by fuzzy clustering-based genetic algorithm

Young Seol Lee, Sung Bae Cho

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

Abstract

The graph coloring problem is one of famous combinatorial optimization problems. Some researchers attempted to solve combinatorial optimization problem with evolutionary algorithm, which can find near optimal solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to evaluate fitness of a large number of individuals in the population when applying the GA to the real world problems. This paper attempts to solve graph coloring problem using a fuzzy clustering based evolutionary approach to reduce the cost of the evaluation. In order to show the feasibility of the method, some experiments with other alternative methods are conducted.

Original language	English
Title of host publication	Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings
Pages	351-360
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-642-34859-4_35
Publication status	Published - 2012
Event	9th International Conference on Simulated Evolution and Learning, SEAL 2012 - Hanoi, Viet Nam Duration: 2012 Dec 16 → 2012 Dec 19

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7673 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	9th International Conference on Simulated Evolution and Learning, SEAL 2012
Country	Viet Nam
City	Hanoi
Period	12/12/16 → 12/12/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-34859-4_35

Fingerprint Dive into the research topics of 'Solving graph coloring problem by fuzzy clustering-based genetic algorithm'. Together they form a unique fingerprint.

Cite this

Lee, Y. S., & Cho, S. B. (2012). Solving graph coloring problem by fuzzy clustering-based genetic algorithm. In Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings (pp. 351-360). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7673 LNCS). https://doi.org/10.1007/978-3-642-34859-4_35

@inproceedings{e5dea963899a4e98965039478af5cd87,

title = "Solving graph coloring problem by fuzzy clustering-based genetic algorithm",

abstract = "The graph coloring problem is one of famous combinatorial optimization problems. Some researchers attempted to solve combinatorial optimization problem with evolutionary algorithm, which can find near optimal solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to evaluate fitness of a large number of individuals in the population when applying the GA to the real world problems. This paper attempts to solve graph coloring problem using a fuzzy clustering based evolutionary approach to reduce the cost of the evaluation. In order to show the feasibility of the method, some experiments with other alternative methods are conducted.",

author = "Lee, {Young Seol} and Cho, {Sung Bae}",

year = "2012",

doi = "10.1007/978-3-642-34859-4_35",

language = "English",

isbn = "9783642348587",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "351--360",

booktitle = "Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings",

note = "9th International Conference on Simulated Evolution and Learning, SEAL 2012 ; Conference date: 16-12-2012 Through 19-12-2012",

}

Lee, YS & Cho, SB 2012, Solving graph coloring problem by fuzzy clustering-based genetic algorithm. in Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7673 LNCS, pp. 351-360, 9th International Conference on Simulated Evolution and Learning, SEAL 2012, Hanoi, Viet Nam, 12/12/16. https://doi.org/10.1007/978-3-642-34859-4_35

Solving graph coloring problem by fuzzy clustering-based genetic algorithm. / Lee, Young Seol; Cho, Sung Bae.

Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings. 2012. p. 351-360 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7673 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Solving graph coloring problem by fuzzy clustering-based genetic algorithm

AU - Lee, Young Seol

AU - Cho, Sung Bae

PY - 2012

Y1 - 2012

N2 - The graph coloring problem is one of famous combinatorial optimization problems. Some researchers attempted to solve combinatorial optimization problem with evolutionary algorithm, which can find near optimal solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to evaluate fitness of a large number of individuals in the population when applying the GA to the real world problems. This paper attempts to solve graph coloring problem using a fuzzy clustering based evolutionary approach to reduce the cost of the evaluation. In order to show the feasibility of the method, some experiments with other alternative methods are conducted.

AB - The graph coloring problem is one of famous combinatorial optimization problems. Some researchers attempted to solve combinatorial optimization problem with evolutionary algorithm, which can find near optimal solution based on the evolution mechanism of the nature. However, it sometimes requires too much cost to evaluate fitness of a large number of individuals in the population when applying the GA to the real world problems. This paper attempts to solve graph coloring problem using a fuzzy clustering based evolutionary approach to reduce the cost of the evaluation. In order to show the feasibility of the method, some experiments with other alternative methods are conducted.

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

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

U2 - 10.1007/978-3-642-34859-4_35

DO - 10.1007/978-3-642-34859-4_35

M3 - Conference contribution

AN - SCOPUS:84871363027

SN - 9783642348587

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 351

EP - 360

BT - Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings

T2 - 9th International Conference on Simulated Evolution and Learning, SEAL 2012

Y2 - 16 December 2012 through 19 December 2012

ER -

Lee YS, Cho SB. Solving graph coloring problem by fuzzy clustering-based genetic algorithm. In Simulated Evolution and Learning - 9th International Conference, SEAL 2012, Proceedings. 2012. p. 351-360. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-34859-4_35