Two genetic algorithms for the bandwidth multicoloring problem
In this paper the Bandwidth Multicoloring Problem (BMCP) and the Bandwidth Coloring Problem (BCP) are considered. The problems are solved by two genetic algorithms (GAs) which use the integer encoding and standard genetic operators adapted to the problems. In both proposed implementations, all i...
Main Author: | Fijuljanin Jasmina |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2012-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2012/0354-02431200020F.pdf |
Similar Items
-
A new genetic representation for quadratic assignment problem
by: Kratica Jozef, et al.
Published: (2011-01-01) -
On the <i>Embed and Project</i> Algorithm for the Graph Bandwidth Problem
by: Janez Povh
Published: (2021-08-01) -
On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness
by: Fata, Elaheh
Published: (2013) -
On Two Combinatorial Optimization Problems in Graphs: Grid Domination and Robustness
by: Fata, Elaheh
Published: (2013) -
The bandwidth and coloring problems of graphs
by: Chan, Wai Hong
Published: (2003)