A discrete firefly algorithm based on similarity for graph coloring problems

In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. The original FA handles continuous optimization problems only. To apply it to discrete problems, we should redefined the original FA over discrete space. In this work, we introduce a new algorithm based on Similarity and discretize FA directly without any other hybrid algorithm. The experiments show that the proposed method outperforms the success rate of HDPSO and HDABC when solving planar graph coloring problems.

[1]  Guangzhao Cui,et al.  Modified PSO algorithm for solving planar graph coloring problem , 2008 .

[2]  Takuya Aoki,et al.  PSO Algorithm with Transition Probability Based on Hamming Distance for Graph Coloring Problem , 2015, 2015 IEEE International Conference on Systems, Man, and Cybernetics.

[3]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[4]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[5]  Juanjuan He,et al.  Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem , 2015, BIC-TA.

[6]  Iztok Fister,et al.  Memetic firefly algorithm for combinatorial optimization , 2012, 1204.5165.

[7]  Kui Chen,et al.  A Discrete Artificial Bee Colony Algorithm Based on Similarity for Graph Coloring Problems , 2016, TPNC.

[8]  Pingzhi Fan,et al.  MTPSO algorithm for solving planar graph coloring problem , 2011, Expert Syst. Appl..

[9]  Hitoshi Kanoh,et al.  Particle Swarm Optimization with Transition Probability for Timetabling Problems , 2013, ICANNGA.

[10]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[11]  Giulio Sandini,et al.  Robots and Biological Systems: Towards a New Bionics? , 2012, NATO ASI Series.

[12]  Siti Zaiton Mohd Hashim,et al.  University course timetable planning using hybrid particle swarm optimization , 2009, GEC '09.

[13]  狩野 均,et al.  Solving Time-Dependent Traveling Salesman Problems using Ant Colony Optimization Based on Predicted Traffic , 2011 .

[14]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[15]  Edmund K. Burke,et al.  Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems , 2009, J. Oper. Res. Soc..

[16]  Jonas Krause,et al.  A Survey of Swarm Algorithms Applied to Discrete Optimization Problems , 2013 .

[17]  Janez Brest,et al.  A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring , 2012, ICAISC.

[18]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[19]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[20]  Xin-She Yang,et al.  Swarm Intelligence and Bio-Inspired Computation , 2013 .

[21]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[22]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..