Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   AMIRKABIR   Spring 2003 , Volume 14 , Number 54-A; Page(s) 363 To 369.
 
Paper: 

A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM

 
 
Author(s):  LUCAS C., SHAHMIRZADI D., BIGLARBEGIAN M.
 
* 
 
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.

 
Keyword(s): SYMBIOSIS, CO-EVOLUTION, OPTIMIZATION, GRAPH COLOURING PROBLEM
 
 
References: 
  • Not Registered.
  •  
  •  
 
Citations: 
  • Not Registered.
 
+ Click to Cite.
APA: Copy

LUCAS, C., & SHAHMIRZADI, D., & BIGLARBEGIAN, M. (2003). A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM. AMIRKABIR, 14(54-A), 363-369. https://www.sid.ir/en/journal/ViewPaper.aspx?id=5038



Vancouver: Copy

LUCAS C., SHAHMIRZADI D., BIGLARBEGIAN M.. A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM. AMIRKABIR. 2003 [cited 2021June21];14(54-A):363-369. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=5038



IEEE: Copy

LUCAS, C., SHAHMIRZADI, D., BIGLARBEGIAN, M., 2003. A CO-EVOLUTIONARY APPROACH TO GRAPH COLORING PROBLEM. AMIRKABIR, [online] 14(54-A), pp.363-369. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=5038.



 
 
Persian Abstract Yearly Visit 43
 
 
Latest on Blog
Enter SID Blog