A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

LUCAS C.; SHAHMIRZADI D.; BIGLARBEGIAN M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2003 | Volume:14 | Issue:54-A Page(s): 363-369

Download Full-Text

Persian Verion

View:

1,119

Download:

Cites:

Information Journal Paper

Title

A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM

Author(s)

LUCAS C. | SHAHMIRZADI D. | BIGLARBEGIAN M. | Issue Writer Certificate

Keywords

SYMBIOSISQ4

CO-EVOLUTIONQ4

OPTIMIZATIONQ2

GRAPH COLOURING PROBLEMQ4

Abstract

This paper begins with a review of the GRAPH COLOURING PROBLEM and its literature. Next developed methods for solving the problem are examined. Intelligent methods have demonstrated superior efficiency, since the problem is a NP-hard benchmark. A CO-EVOLUTIONary algorithm for solving this problem is presented in this paper. The algorithm consists of two populations that simultaneously evolve using genetic operations. Eventually, the complete solution is found through merging individual members of the two populations. The effectiveness of the procedure has been compared to that of a simple genetic algorithm. The obtained results show significant advantage over the traditional routines.

Cites

No record.

References

No record.

Cite

APA: Copy

LUCAS, C., SHAHMIRZADI, D., & BIGLARBEGIAN, M.. (2003). A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM. AMIRKABIR, 14(54-A), 363-369. SID. https://sid.ir/paper/888/en

Vancouver: Copy

LUCAS C., SHAHMIRZADI D., BIGLARBEGIAN M.. A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM. AMIRKABIR[Internet]. 2003;14(54-A):363-369. Available from: https://sid.ir/paper/888/en

IEEE: Copy

C. LUCAS, D. SHAHMIRZADI, and M. BIGLARBEGIAN, “A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM,” AMIRKABIR, vol. 14, no. 54-A, pp. 363–369, 2003, [Online]. Available: https://sid.ir/paper/888/en

Related Journal Papers