skip to main content
10.1145/2001576.2001648acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

An efficient hierarchical parallel genetic algorithm for graph coloring problem

Published: 12 July 2011 Publication History

Abstract

Graph coloring problems (GCPs) are constraint optimization problems with various applications including scheduling, time tabling, and frequency allocation. The GCP consists in finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. We propose a parallel approach based on Hierarchical Parallel Genetic Algorithms (HPGAs) to solve the GCP. We also propose a new extension to PGA, that is Genetic Modification (GM) operator designed for solving constraint optimization problems by taking advantage of the properties between variables and their relations. Our proposed GM for solving the GCP is based on a novel Variable Ordering Algorithm (VOA). In order to evaluate the performance of our new approach, we have conducted several experiments on GCP instances taken from the well known DIMACS website. The results show that the proposed approach has a high performance in time and quality of the solution returned in solving graph coloring instances taken from DIMACS website. The quality of the solution is measured here by comparing the returned solution with the optimal one.

References

[1]
D. Brélaz. New methods to color the vertices of a graph. Commun. ACM, 22:251--256, April 1979.
[2]
P. Briggs, K. D. Cooper, and L. Torczon. Improvements to graph coloring register allocation. ACM Trans. Program. Lang. Syst., 16(3):428--455, May 1994.
[3]
E. Cantu-Paz. Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, 2000.
[4]
M. Caramia and P. Dell'Olmo. Iterative coloring extension of a maximum clique. Naval Research Logistic, 48(6):518--550, 2001.
[5]
G. Chaitin. Register allocation and spilling via graph coloring. SIGPLAN Not., 39(4):66--74, 2004.
[6]
J. Cui, T. C. Fogarty, and J. G. Gammack. Searching databases using parallel genetic algorithms on a transputer computing surface. Future Gener. Comput. Syst., 9(1):33--40, May 1993.
[7]
V. Cutello, G. Nicosia, and M. Pavone. A hybrid immune algorithm with information gain for the graph coloring problem. In Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI, GECCO'03, pages 171--182, Berlin, Heidelberg, 2003. Springer-Verlag.
[8]
M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
[9]
D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1989.
[10]
W. Klotz. Graph coloring algorithms. In Mathematics Report, pages 1--9. Technical University Clausthal, 2002.
[11]
F. T. Leighton. A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84(6):489--506, 1979.
[12]
D. Lim, Y.-S. Ong, Y. Jin, B. Sendhoff, and B.-S. Lee. Efficient hierarchical parallel genetic algorithms using grid computing. Future Gener. Comput. Syst., 23(4):658--670, May 2007.
[13]
Z. Liu, A. Liu, C. Wang, and Z. Niu. Evolving neural network using real coded genetic algorithm (ga) for multispectral image classification. Future Gener. Comput. Syst., 20(7):1119--1129, October 2004.
[14]
B. B. Mabrouk, H. Hasni, and Z. Mahjoub. On a parallel genetic-tabu search based algorithm for solving the graph colouring proble. European Journal of Operational Research, 197(3):1192--1201, 2009.
[15]
D. Marx. Graph coloring with local and global constraints. PhD thesis, Budapest University of Technology and Economics, 2004.
[16]
A. Mehrotra and M. A. Trick. A column generation approach for graph coloring. INFORMS Journal on Computing, 8:344--354, 1995.
[17]
J. Riihijarvi, M. Petrova, and P. Mahonen. Frequency allocation for wlans using graph colouring techniques. In Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services, pages 216--222, Washington, DC, USA, 2005. IEEE Computer Society.
[18]
G. A. Sena, D. Megherbi, and G. Isern. Implementation of a parallel genetic algorithm on a cluster of workstations: traveling salesman problem, a case study. Future Gener. Comput. Syst., 17(4):477--488, January 2001.
[19]
P. Svenson and M. G. Nordahl. Relaxation in graph coloring and satisfiability problems. Phys. Rev. E, 59(4):3983--3999, April 1999.

Cited By

View all
  • (2024)A new distributed graph coloring algorithm for large graphsCluster Computing10.1007/s10586-023-03988-x27:1(875-891)Online publication date: 1-Feb-2024
  • (2023)Intelligent Information Technology for Structural Optimization of Fuzzy Control and Decision-Making SystemsArtificial Intelligence in Control and Decision-making Systems10.1007/978-3-031-25759-9_7(127-165)Online publication date: 18-Apr-2023
  • (2023)Automatic Synthesis of Rule Bases of Fuzzy Control Systems Based on Genetic AlgorithmsRecent Developments and the New Directions of Research, Foundations, and Applications10.1007/978-3-031-20153-0_9(101-123)Online publication date: 15-Jun-2023
  • Show More Cited By

Index Terms

  1. An efficient hierarchical parallel genetic algorithm for graph coloring problem

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation
    July 2011
    2140 pages
    ISBN:9781450305570
    DOI:10.1145/2001576
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 July 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. graph coloring problems (GCPs)
    2. parallel genetic algorithms (PGAs)

    Qualifiers

    • Research-article

    Conference

    GECCO '11
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 23 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)A new distributed graph coloring algorithm for large graphsCluster Computing10.1007/s10586-023-03988-x27:1(875-891)Online publication date: 1-Feb-2024
    • (2023)Intelligent Information Technology for Structural Optimization of Fuzzy Control and Decision-Making SystemsArtificial Intelligence in Control and Decision-making Systems10.1007/978-3-031-25759-9_7(127-165)Online publication date: 18-Apr-2023
    • (2023)Automatic Synthesis of Rule Bases of Fuzzy Control Systems Based on Genetic AlgorithmsRecent Developments and the New Directions of Research, Foundations, and Applications10.1007/978-3-031-20153-0_9(101-123)Online publication date: 15-Jun-2023
    • (2020)A Generic Flexible and Scalable Framework for Hierarchical Parallelization of Population-Based MetaheuristicsProceedings of the 12th International Conference on Management of Digital EcoSystems10.1145/3415958.3433041(124-131)Online publication date: 2-Nov-2020
    • (2020)High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and QualitySC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00103(1-17)Online publication date: Nov-2020
    • (2016)A decentralized fault tolerance model based on level of performance for grid environmentCluster Computing10.1007/s10586-015-0497-x19:1(13-27)Online publication date: 1-Mar-2016
    • (2016)Variable ordering and constraint propagation for constrained CP-netsApplied Intelligence10.1007/s10489-015-0708-444:2(437-448)Online publication date: 1-Mar-2016
    • (2015)Graph Coloring Based on Evolutionary Algorithms to Support Data Hiding Scheme on Medical ImagesProcedia Computer Science10.1016/j.procs.2015.12.09574(173-177)Online publication date: 2015
    • (2015)Winner Determination in Multi-attribute Combinatorial Reverse AuctionsNeural Information Processing10.1007/978-3-319-26555-1_73(645-652)Online publication date: 9-Dec-2015
    • (2014)A Binary Cuckoo Search Algorithm for Graph Coloring ProblemInternational Journal of Applied Evolutionary Computation10.4018/ijaec.20140701035:3(42-56)Online publication date: 1-Jul-2014
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media