Skip to main content
SpringerLink
Log in

Discrete selfish herd optimizer for solving graph coloring problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Selfish herd optimizer is a new and effective continuous optimization algorithm, but the algorithm cannot solve the specific discrete problem. Therefore, we design a discrete selfish herd optimizer (DSHO) specifically for solving graph coloring problems. At present, many existing methods cannot effectively solve graph coloring problems. To deal with this difficult problem, in DSHO, we propose an effective step-size updating method. This step-size update method is not random, but is updated based on the conflict matrix of candidate solutions. Moreover, we also add a mechanism to deal with potential color conflict areas. By using these methods, DSHO can effectively reduce the number of conflict areas when calculating the conflict matrix of candidate solutions. To verify DSHO’s optimization performance, we use 83 test cases, they includes five simulated maps, six real maps (China, New York, America, Paris, France and Russia) and 72 test cases of minimum coloring number (They come from DIMACS Implementation Challenge). DSHO compare with the latest coloring algorithms, they are DABC, DFA, GETS, HACO, LGFPA, FROGSIM and SDGC, respectively. The experimental outcomes exhibit that DSHO has minimum number of conflict areas, smaller standard deviation, fewer iterations and higher coloring success rate. Discrete selfish herd optimizer is more competitive than other algorithms. Therefore, it is a new method for solving graph coloring problems effectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig.1
Fig.2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35
Fig. 36
Fig. 37
Fig. 38
Fig. 39
Fig. 40
Fig. 41
Fig. 42
Fig. 43
Fig. 44
Fig. 45
Fig. 46

Similar content being viewed by others

References

  1. Fausto F, Cuevas E, Valdivia A, González A (2017) A global optimization algorithm inspired in the behavior of selfish herds. Biosystems 160:39–55

    Article  Google Scholar 

  2. Agrawal J, Agrawal S (2015) Acceleration based particle swarm optimization for graph coloring problem. 19th international conference on knowledge based and intelligent information and engineering systems. Procedia Computer Science 60:714–721

    Article  Google Scholar 

  3. Bensouyad M, Guidoum N, Saïdouni D-E (2015) A new and fast evolutionary algorithm for strict strong graph coloring problem. The international conference on advanced wireless, information, and communication technologies (AWICT 2015). Procedia Computer Science 73:138–145

    Article  Google Scholar 

  4. Jin Y, Hao J-K (2016) Hybrid evolutionary search for the minimum sum-coloring problem of graphs. Inf Sci 16:15–34

    Article  Google Scholar 

  5. Lourenço N, Martins R, Canelas A, Póvoa R, Horta N (2016) AIDA: layout-aware analog circuit-level sizing with in-loop layout generation. Integr VLSI J 55:316–329

    Article  Google Scholar 

  6. Kasprowicz D, Wada H (2014) Methods for automated detection of plagiarism in integrated-circuit layouts. Microelectron J 45(9):1212–1219

    Article  Google Scholar 

  7. Feng J, Che A (2018) Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments. Comput Oper Res 95:163–171

    Article  MathSciNet  Google Scholar 

  8. Rideaux R, Baker E, Edwards M (2018) Parallel consolidation into visual working memory results in reduced precision representations. Vis Res 149:24–29

    Article  Google Scholar 

  9. Leite N, Fernandes CM, Melício F, Rosa AC (2018) A cellular memetic algorithm for the examination-timetabling problem. Comput Oper Res 94:118–138

    Article  MathSciNet  Google Scholar 

  10. Song T, Liu S, Tang X, Peng X, Chen M (2018) An iterated local search algorithm for the university course timetabling problem. Appl Soft Comput 68:597–608

    Article  Google Scholar 

  11. Jianguo Q, Yang L, Gao Y, Di Z (2018) Service-oriented train timetabling problem with consideration of women-only passenger cars. Comput Ind Eng In Press 5. https://doi.org/10.1016/j.cie.2018.04.054

  12. Je-HyungLee S-MM, Park J (2017) Region-based dual bank register allocation for reduced instruction encoding architectures. Microprocess Microsyst 55:26–43

    Article  Google Scholar 

  13. Kiran DC, Gurunarayanan S, Misra JP, Bhatia M (2017) Register allocation for fine grain threads on multicore processor. Journal of King Saud University - Computer and Information Sciences 29:85–92

    Article  Google Scholar 

  14. Faraji M (2011) Proposing a new algorithm based on bees behavior for solving graph coloring. Int J Contemp Math Sciences 6:41–49

    MathSciNet  MATH  Google Scholar 

  15. Douiri SM, Elbernoussi S (2015) Solving the graph coloring problem via hybrid genetic algorithms. Journal of King Saud University – Engineering Sciences 27:114–118

    Article  Google Scholar 

  16. Rebollo-Ruiz I, Graña M (2014) An empirical evaluation of gravitational swarm intelligence for graph coloring algorithm. Neurocomputing 132:79–84

    Article  Google Scholar 

  17. Hong B (1999) Generic algorithm of color planar graph. J Guizhou Univ (Nat Sci) 11(16):232–297

    Google Scholar 

  18. Liu W, Zhang F, Xu J (2002) A DNA algorithm for the graph-coloring problem. J Chem Inf Comput Sci 42(5):1176–1178

    Article  Google Scholar 

  19. Bui TN, Nguyen TH, Patel CM, Phan K-AT (2008) An ant-based algorithm for coloring graphs. Discret Appl Math 156:190–200

    Article  MathSciNet  Google Scholar 

  20. Cui G, Qin L, Liu S, Wang Y, Zhang X, Cao X (2008) Modified PSO algorithm for solving planar graph coloring problem. Prog Nat Sci 18:353–357

    Article  Google Scholar 

  21. Talavan PM, Yanez J (2008) The graph-coloring problem: a neuronal network approach. Eur J Oper Res 191:100–111

    Article  MathSciNet  Google Scholar 

  22. Porumbel DC, Hao J-K, Kuntz P (2009) Position-guided Tabu search algorithm for the graph coloring problem. Learning and Intelligent Optimization 5851:148–162

    Article  Google Scholar 

  23. Hsu L-Y, Horng S-J, Fan P, Khan MK, Wang Y-R, Run R-S, Lai J-L, Chen R-J (2011) MTPSO algorithm for solving planar graph coloring problem. Expert Syst Appl 38:5525–5531

    Article  Google Scholar 

  24. Fister I, Brest J (2011) Using Dierential evolution for the graph coloring. Symposium on differential evolution (SDE), vol 4. IEEE, Paris, pp 112–121

    Google Scholar 

  25. Hongshun C, Peng Z (2013) An ant algorithm for solving the four coloring map problem. Ninth International Conference on Natural Computation (ICNC): 491–495

  26. Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. Appl Soft Comput 33:48–64

    Article  Google Scholar 

  27. Wang R, Zhou Y, Zhou Y, Bao Z (2015) Local greedy flower pollination algorithm for solving planar graph coloring problem. J Comput Theor Nanosci 12:1–10

    Article  Google Scholar 

  28. Fidanova S, Pop P (2016) An improved hybrid ant-local search algorithm for the partition graph coloring problem. J Comput Appl Math 293:55–61

    Article  MathSciNet  Google Scholar 

  29. Chen K, Kanoh H (2016) A Discrete Artificial Bee Colony Algorithm Based on Similarity for Graph Coloring Problems. International Conference on Theory and Practice of Natural Computing: 73–84

  30. ,Chen K, Kanoh H (2017) A discrete firefly algorithm based on similarity for graph coloring problems. 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD): 65–70

  31. Marappan R, Sethumadhavan G (2018) Solution to graph coloring using genetic and Tabu search procedures. Arab J Sci Eng 43(2):525–542

    Article  Google Scholar 

  32. Hamilton WD (1971) Geometry to the selfish herd. J Theory Biology 31(2):295–311

    Article  Google Scholar 

  33. Johnson DS, Trick MA (1996) Cliques, coloring, and Satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence

    Book  Google Scholar 

  34. Hernández H, Blum C (2012) Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs. Swarm Intelligence 6:117–150

    Article  Google Scholar 

  35. Hernández H, Blum C (2014) FrogSim: distributed graph coloring in wireless ad hoc networks. Telecommun Syst 55:211–223

    Article  Google Scholar 

  36. Galán SF (2017) Simple decentralized graph coloring. Comput Optim Appl 66(1):163–185

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This article has been awarded by the National Natural Science Foundation of China (61941113, 81674099, 61502233), the Fundamental Research Fund for the Central Universities (30918015103, 30918012204), Nanjing Science and Technology Development Plan Project (201805036), and “13th Five-Year” equipment field fund (61403120501), China Academy of Engineering Consulting Research Project (2019-ZD-1-02-02).

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, 210094, Jiangsu, China

    Ruxin Zhao, Yongli Wang, Peng Hu, Hamed Jelodar, Mahdi Rabbani & Hao Li

  2. CETC Big Data Research Institute Co., Ltd, Guiyang, 550000, Guizhou, China

    Yongli Wang

  3. School of Mechanical and Automotive Engineering, Yangzhou Polytechnic institute, Yangzhou, 225000, Jiangsu, China

    Chang Liu

Authors
  1. Ruxin Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yongli Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peng Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hamed Jelodar
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Mahdi Rabbani
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Hao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongli Wang.

Ethics declarations

Conflict of interest

All authors have no conflict of interest.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, R., Wang, Y., Liu, C. et al. Discrete selfish herd optimizer for solving graph coloring problem. Appl Intell 50, 1633–1656 (2020). https://doi.org/10.1007/s10489-020-01636-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-020-01636-0

Keywords

Search

Navigation