article

Graph Coloring with Adaptive Evolutionary Algorithms

Authors:

J. K. Van Der Hauw,

J. I. Van HemertAuthors Info & Claims

Journal of Heuristics, Volume 4, Issue 1

Pages 25 - 46

https://doi.org/10.1023/A:1009638304510

Published: 01 June 1998 Publication History

Abstract

This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity.

References

[1]

Angeline, P. (1995). "Adaptive and Self-Adaptive Evolutionary Computation." In M. Palaniswami, Y. Attikiouzel, R.J. Marks, D. Fogel, and T. Fukuda (eds.), Computational Intelligence: A Dynamic System Perspective. IEEE Press, pp. 152-161.

[2]

Arora, S., C. Lund, R. Motwani, M. Sudan, and M. Szegedy. (1992). "Proof Verification and Hardness of Approximation Problems," Proceedings 33rd IEEE Symposium on the Foundations of Computer Science. IEEE Computer Sociecty, Los Angeles, CA, pp. 14-23.

[3]

Bäck, T., D. Fogel, and Z. Michalewicz. (eds.) (1997). Handbook of Evolutionary Computation. Bristol: Institute of Physics Publishing and New York: Oxford University Press.

[4]

Belew, R. and L. Booker. (eds.) (1991). Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann.

[5]

Blum, A. (1989). "An O(n ^0.4)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithms for k-Coloring)," Proceedings of the 21st ACM Symposium on Theory of Computing. New York, ACM, pp. 535-542.

Digital Library

[6]

Brélaz, D. (1979). "New Methods to Color Vertices of a Graph," Communications of the ACM 22, 251-256.

Digital Library

[7]

Cheeseman, P., B. Kenefsky, and W.M. Taylor. (1991). "Where the Really Hard Problems Are." In J. Mylopoulos, and R. Reiter (eds.), Proceedings of the 12th IJCAI-91. Morgan Kaufmann, vol. 1, pp. 331-337.

[8]

Clearwater, S. and T. Hogg. (1996). "Problem Structure Heuristics and Scaling Behavior for Genetic Algorithms," Artificial Intelligence 81, 327-347.

[9]

Coll, P., G. Durán, and P. Moscato. (1995). "A Discussion on Some Design Principles for Efficient Crossover Operators for Graph Coloring Problems," Anales del XXVII Simposio Brasileiro de Pesquisa Operacional.

[10]

Culberson, J. (1996). "On the Futility of Blind Search," Technical Report TR 96-18, The University of Alberta.

[11]

Culberson, J. and F. Luo. (1996). "Exploring the k-Colorable Landscape with Iterated Greedy." In D. Johnson and M. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. American Mathematical Society, pp. 245-284. Available by http://web.cs.ualberta.ca/~joe/.

[12]

Davis, L. (1991). "Order-Based Genetic Algorihms and the Graph Coloring Problem." Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, pp. 72-90.

[13]

De Jong, K. and W. Spears. (1992). "A Formal Analysis of the Role of Multi-point Crossover in Genetic Algorithms," Annals of Mathematics and Artificial Intelligence 5, 1-26.

[14]

Eiben, A., P.-E. Raué, and Z. Ruttkay. (1994). "Genetic Algorithms with Multi-parent Recombination." In Y. Davidor, H.-P. Schwefel, and R. Männer (eds.), Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in Lecture Notes in Computer Science. Springer-Verlag, pp. 78-87.

Digital Library

[15]

Eiben, A., P.-E. Raué, and Z. Ruttkay. (1995a). "Constrained Problems." In L. Chambers (ed.), Practical Handbook of Genetic Algorithms. CRC Press, pp. 307-365.

[16]

Eiben, A., P.-E. Raué, and Z. Ruttkay. (1995b). "GA-Easy and GA-Hard Constraint Satisfaction Problems." In M. Meyer (ed.), Proceedings of the ECAI-94 Workshop on Constraint Processing, number 923 in Lecture Notes in Computer Science. Springer-Verlag, pp. 267-284.

Digital Library

[17]

Eiben, A. and Z. Ruttkay. (1996). "Self-adaptivity for Constraint Satisfaction: Learning Penalty Functions," Proceedings of the 3rd IEEE Conference on Evolutionary Computation. IEEE Press, pp. 258-261.

[18]

Eiben, A. and J. van der Hauw. (1996). "Graph Coloring with Adaptive Evolutionary Algorithms," Technical Report TR-96-11, Leiden University. Also available as http:// www.wi.leidenuniv.nl/~gusz/graphcol.ps.gz.

[19]

Eiben, A. and J. van der Hauw. (1997). "Solving 3-SAT by GAS Adapting Constraint Weights," Proceedings of the 4th IEEE Conference on Evolutionary Computation. IEEE Press, pp. 81-86.

[20]

Eiben, A. and Z. Ruttkay. (1997). "Constraint Satisfaction Problems." In T. Bäck et al. (eds.), Handbook of Evolutionary Computation. Bristol: Institute of Physics Publishing, and New York: Oxford University Press.

[21]

Falkenauer, E. (1994). "A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems," Evolutionary Computation 2(2), 123-144.

Digital Library

[22]

Falkenauer, E. (1996). "A Hybrid Grouping Genetic Algorithm for Bin Packing," Journal of Heuristics 2, 5-30.

[23]

Falkenauer, E. and A. Delchambre. (1992). "A Genetic Algorithm for Bin Packing and Line Balancing," Proceedings of the IEEE 1992 Int. Conference on Robotics and Automation. IEEE Computer Society Press, pp. 1186- 1192.

[24]

Fleurent, C. and J. Ferland. (1996a). "Genetic and Hybrid Algorithms for Graph Coloring." In I.H.O. G. Laporte and P.L. Hammer (eds.), Annals of Operations Research, number 63 in Metaheuristics in Combinatorial Optimization . J.C. Baltzer AG, Science Publishers, pp. 437-461.

[25]

Fleurent, C. and J. Ferland. (1996b). "Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique, and Satisfiability." In M.A. Trick and D.S. Johnson (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 619-652.

[26]

Fogel, D. (1995). Evolutionary Computation. IEEE Press.

Digital Library

[27]

Fox, B. and M. McMahon. (1991). "Genetic Operators for Sequencing Problems." In G. Rawlins (ed.), Foundations of Genetic Algorithms. Morgan Kaufmann, pp. 284-300.

[28]

Frank, J. (1996a). "Learning Short-term Weights For GSAT," Technical Report, University of California at Davis. Available by http://rainier.cs.ucdavis.edu/~frank/decay.ml96.ps.

[29]

Frank, J. (1996b). "Weighting for Godot: Learning Heuristics For GSAT," Proceedings of the 13th AAAI-96. AAAI/The MIT Press, pp. 338-343.

Digital Library

[30]

Garey, M. and D. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freedman and Co.

Digital Library

[31]

Glover, F. (1996). "Tabu Search and Adaptive Memory Programming--Advances, Applications, and Challenges," Interfaces in Computer Science and Operations Research. Norwell, MA: Kluwer Academic Publishers, pp. 1- 75.

[32]

Grimmet, G. and C. McDiarmid. (1975). "On Colouring Random Graphs," Mathematical Proceedings of the Cambridge Philosophical Society 77, 313-324.

[33]

Hinterding, R., Z. Michalewicz, and A. Eiben. (1997). "Adaptation in Evolutionary Computation: A Survey," Proceedings of the 4th IEEE Conference on Evolutionary Computation. IEEE Press, pp. 65-69.

[34]

Johnson, D., C. Aragon, L. McGeoch, and C. Schevon. (1991). "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning," Operations Research 39(3), 378- 406.

Digital Library

[35]

Kronsjo, L. (1987). Algorithms: Their Complexity and Efficiency. Wiley and Sons, second edition.

Digital Library

[36]

Kucera, L. (1991). "The Greedy Coloring is a Bad Probabilistic Algorithm," Journal of Algorithms 12, 674-684.

Digital Library

[37]

Laszewski, G.V. (1991). "Intelligent Structural Operators For the k-Way Graph Partitioning Problem." In R. Belew and L. Booker (eds.), Proceeding of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann, pp. 45-52.

[38]

Løkketangen, A. and F. Glover. (1996). "Surrogate Constraint Methods with Simple Learning for Satisfiability Problems." In D. Du, J. Gu, and P. Pardalos (eds.), Proceedings of the DIMACS workshop on Satisfiability Problems: Theory and Applications. American Mathematical Society.

[39]

Morris, P. (1993). "The Breakout Method for Escaping From Local Minima," Proceedings of the 11th National Conference on Artificial Intelligence, AAAI-93. AAAI Press/The MIT Press, pp. 40-45.

[40]

Nudel, B. (1983). "Consistent-Labeling Problems and Their Algorithms: Expected Complexities and Theory Based Heuristics," Artificial Intelligence 21, 135-178.

Digital Library

[41]

Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. New York: Wiley.

Digital Library

[42]

Selman, B. and H. Kautz. (1993). "Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems." In R. Bajcsy (ed.), Proceedings of IJCAI'93. Morgan Kaufmann, pp. 290-295.

[43]

Starkweather, T., S. McDaniel, K. Mathias, D. Whitley, and C. Whitley. (1991). "A Comparison of Genetic Sequenceing Operators." In R. Belew and L. Booker (eds.), Proceedings of the 4th International Conference on Genetic Algorithms. Morgan Kaufmann, pp. 69-76.

[44]

Turner, J. (1988). "Almost All k-Colorable Graphs are Easy to Color," Journal of Algorithms 9, 63-82.

Digital Library

[45]

Wolpert, D. and W. Macready. (1997). "No Free Lunch Theorems for Optimization," IEEE Transactions on Evolutionary Computation 1(1), 67-82.

Digital Library

Cited By

Besta MCarigiet AJanda KVonarburg-Shmaria ZGianinazzi LHoefler TCuicchi CQualters IKramer W(2020)High-performance parallel graph coloring with strong guarantees on work, depth, and qualityProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.5555/3433701.3433833(1-17)Online publication date: 9-Nov-2020
https://dl.acm.org/doi/10.5555/3433701.3433833
Mensi ACondotta JNouaouri ISioutis MBen Saïd L(2018)A Hybrid Evolutionary Algorithm for Maximizing Satisfiability in Temporal or Spatial Qualitative ConstraintsProceedings of the 10th Hellenic Conference on Artificial Intelligence10.1145/3200947.3201021(1-9)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3200947.3201021
Bidar MMouhoub MSadaoui S(2018)Discrete Firefly Algorithm: A New Metaheuristic Approach for Solving Constraint Satisfaction Problems2018 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2018.8477823(1-8)Online publication date: 8-Jul-2018
https://dl.acm.org/doi/10.1109/CEC.2018.8477823
Show More Cited By

Index Terms

Graph Coloring with Adaptive Evolutionary Algorithms

Recommendations

Evolving evolutionary algorithms using evolutionary algorithms
GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

A new model for automatic generation of Evolutionary Algorithms (EAs) by evolutionary means is proposed in this paper. The model is based on a simple Genetic Algorithm (GA). Every GA chromosome encodes an EA, which is used for solving a particular ...
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm

This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic, and a neutral survivor selection operator. ...
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformatics

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Heuristics

Journal of Heuristics Volume 4, Issue 1

June 1998

95 pages

ISSN:1381-1231

Issue’s Table of Contents

Copyright © Copyright © 1998 Kluwer Academic Publishers.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 June 1998

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Besta MCarigiet AJanda KVonarburg-Shmaria ZGianinazzi LHoefler TCuicchi CQualters IKramer W(2020)High-performance parallel graph coloring with strong guarantees on work, depth, and qualityProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.5555/3433701.3433833(1-17)Online publication date: 9-Nov-2020
https://dl.acm.org/doi/10.5555/3433701.3433833
Mensi ACondotta JNouaouri ISioutis MBen Saïd L(2018)A Hybrid Evolutionary Algorithm for Maximizing Satisfiability in Temporal or Spatial Qualitative ConstraintsProceedings of the 10th Hellenic Conference on Artificial Intelligence10.1145/3200947.3201021(1-9)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3200947.3201021
Bidar MMouhoub MSadaoui S(2018)Discrete Firefly Algorithm: A New Metaheuristic Approach for Solving Constraint Satisfaction Problems2018 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2018.8477823(1-8)Online publication date: 8-Jul-2018
https://dl.acm.org/doi/10.1109/CEC.2018.8477823
Aleti AMoser I(2016)A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary AlgorithmsACM Computing Surveys10.1145/299635549:3(1-35)Online publication date: 21-Oct-2016
https://dl.acm.org/doi/10.1145/2996355
Karafotias GHoogendoorn MEiben A(2015)Parameter Control in Evolutionary Algorithms: Trends and ChallengesIEEE Transactions on Evolutionary Computation10.1109/TEVC.2014.230829419:2(167-187)Online publication date: 27-Mar-2015
https://dl.acm.org/doi/10.1109/TEVC.2014.2308294
Sayed EEssam DSarker RElsayed S(2015)Decomposition-based evolutionary algorithm for large scale constrained problemsInformation Sciences: an International Journal10.1016/j.ins.2014.10.035316:C(457-486)Online publication date: 20-Sep-2015
https://dl.acm.org/doi/10.1016/j.ins.2014.10.035
Monical CStonedahl FArnold D(2014)Static vs. dynamic populations in genetic algorithms for coloring a dynamic graphProceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2576768.2598233(469-476)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2576768.2598233
Fredericks EDevries BCheng B(2014)AutoRELAXEmpirical Software Engineering10.1007/s10664-014-9305-019:5(1466-1501)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s10664-014-9305-0
Chaurasia SSingh A(2014)A hybrid evolutionary approach to the registration area planning problemApplied Intelligence10.1007/s10489-014-0582-541:4(1127-1149)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1007/s10489-014-0582-5
Fister IMernik MFilipič B(2013)Graph 3-coloring with a hybrid self-adaptive evolutionary algorithmComputational Optimization and Applications10.1007/s10589-012-9496-554:3(741-770)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1007/s10589-012-9496-5
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents