Abstract
In this paper, a novel non-hybrid discrete artificial bee colony (ABC) algorithm is proposed for solving planar graph coloring problems. The original ABC intends to handle only continuous optimization problems. To apply ABC to discrete problems, the original ABC operators need to be redefined over discrete space. In this work, a new algorithm based on Similarity is introduced. Compared with HDPSO, the experiment shows that the proposed method matches the competitive results and obtains higher success rate and lower average evaluation times when solving planar graph coloring problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Beni, G., Wang, J.: Swarm intelligence in cellular robotic systems. Robots and Biological Systems: Towards a New Bionics?, vol. 102, pp. 703–712. Springer, Heidelberg (1993)
Kennedy, J., Eberhart Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Krause, J., Cordeirol, J., Parpinelli, R.S., Heitor S.L.: A survey of swarm algorithms applied to discrete optimization problems. Swarm Intelligence and Bio-Inspired Computation, pp. 169–191 (2013)
Cui, G., Qin, L., Liu, S., Wang, Y., Zhang, X., Cao, X.: Modified PSO algorithm for solving planar graph coloring problem. Progress Nat. Sci. 18, 353–357 (2008)
Hsu, L.-Y., Fan, P., Horng, S.-J., Khurram, M., Wang, Y.-R., Run, R.-S., Lai, J.-L., Chan, R.-J.: MTPSO algorithm for solving planar graph coloring problem. Expert Syst. Appl. 38, 5525–5531 (2001)
Zhang, K., Zhu, W., Liu, J., He, J.: Discrete particle swarm optimization algorithm for solving graph coloring problem. In: 10th International Conference Bio-Inspired Computing - Theories and Applications, pp. 643–652 (2015)
Aoki, T., Aranha, C., Kanoh, H.: PSO algorithm with transition probability based on hamming distance for graph coloring problem. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 1956–1961 (2015)
Qu, R., Burke, E.K.: Hybridizations within a graph-based hyper-heuristic framework for University timetabling problems. J. Oper. Res. Soc. 60, 1273–1285 (2009)
Fen, H.S., Safaai, D., Hashim, M., Zaiton, S.: University course timetable planning using hybrid particle swarm optimization. In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 239–246 (2009)
Kanoh, H., Chen, S.: Particle swarm optimization with transition probability for timetabling problems. In: Tomassini, M., Antonioni, A., Daolio, F., Buesser, P. (eds.) ICANNGA 2013. LNCS, vol. 7824, pp. 256–265. Springer, Heidelberg (2013). doi:10.1007/978-3-642-37213-1_27
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Kanoh, H., Ochiai, J.: Solving time-dependent traveling salesman problems using ant colony optimization based on predicted traffic. In: International Symposium on Distributed Computing and Artificial Intelligence, Advances in Intelligent and Soft Computing, vol. 151, pp. 25–32 (2012)
Karaboga, D., Basturk, B., Owerful, A.: Efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39, 459–471 (2007)
Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12), 2455–2468 (2011)
Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N., Chen, A.H.-L.: A discrete artificial bee colony algorithm for the total flowtime minimization and permutation flow shops. Inf. Sci. 181(16), 3459–3475 (2011)
Fister Jr., I., Fister, I., Brest, J.: A hybrid artificial bee colony algorithm for graph 3-coloring. Swarm Evol. Comput. 7269, 66–74 (2012)
Karaboga, D., Basturk, A.: A survey: algorithms simulating bee swarm intelligence. Artif. Intell. Rev. 31(1–4), 61–85 (2009)
Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair mehod for constraint-satisfaction and scheduling problems. Artif. Intell. 58, 161–205 (1992)
Hogg, T., Williams, C.: The hardest constraint problems, a double phase transition. Artif. Intell. 69(1–2), 359–377 (1994)
Deep, K., Bansal, J.C.: A socio-cognitive particle swarm optimization for multi-dimentional knapsack problem. In: First International Conference on Emerging Trends in Engineering an Technology, pp. 355–360 (2008)
Shen, X., Li, Y., Chen, C., Yang, J., Zhang, D.: Greedy continuous particle swarm optimization algorithm for the knapsack problems. Int. J. Comput. Appl. Technol. 44(2), 137–144 (2012)
Ucar, H., Tasgetiren, M.F.: A particle swarm optimization algorithm for permutation flow shop sequencing problem with the number of tardy jobs criterion. In: 5th International Symposium on Intelligent Manufacturing Systems, pp. 237–250 (2006)
Algorithms, S., Yang, X.S.: Firefly algorithm for multimodal optimization. Found. Appl. 5792, 169–178 (2009)
Sayadi, M.K., Ramezanian, R., Ghaffari-Nasab, N.: A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. Int. J. Ind. Eng. Comput. 1(1), 1–10 (2010)
Palit, S., Sinha, S.N., Molla, M.A., Khanra, A., Kule, M.: A cryptanalytic attack on the knapsack cryptosystem using binary firefly algorithm. In: 2nd International Conference on Computer and Communication Technology, pp. 428–432 (2011)
Banati, H., Bajaj, M.: Firefly based feature selection approach. Int. J. Comput. Sci. Issues 8(4), 73–480 (2011)
Fister, I., Yang, X.S., Fister, I., Brest, J.: Memetic firefly algorithm for combinatorial optimization. In: 5th International Conference on Bioinspired Optimization Methods and Their Applications, pp. 75–86 (2012)
Yang, X.S., Deb, S.: Cuckoo search via levy flights. In: World Congress on Nature and Biologically Inspired Computing, pp. 210–214 (2009)
Burnwal, S., Deb, S.: Scheduling optimization of flexible manufacuring system using cuckoo search-based approach. Int. J. Adv. Manuf. Technol. 64(5), 951–959 (2013)
Gherboudj, A., Layeb, A., Chikhi, S.: Solving 0–1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int. J. Bio-Inspired Comput. 4(4), 229–236 (2012)
Acknowledgments
The authors wish to thank Dr. Claus Aranha of University of Tsukuba for his helpful comments and suggestions. This work is supported by JSPS KAKENHI Grant Number 15K00296.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Chen, K., Kanoh, H. (2016). A Discrete Artificial Bee Colony Algorithm Based on Similarity for Graph Coloring Problems. In: MartÃn-Vide, C., Mizuki, T., Vega-RodrÃguez, M. (eds) Theory and Practice of Natural Computing. TPNC 2016. Lecture Notes in Computer Science(), vol 10071. Springer, Cham. https://doi.org/10.1007/978-3-319-49001-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-49001-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49000-7
Online ISBN: 978-3-319-49001-4
eBook Packages: Computer ScienceComputer Science (R0)