Local Greedy Flower Pollination Algorithm for Solving Planar Graph Coloring Problem

摘要

The graph coloring is a classic NP-complete problem. This paper we propose a local greedy flower pollination algorithm (LGFPA) for solving planar graph coloring problem based on local swap strategy, local reverse strategy, and discard pollen strategy. The proposed algorithm can solve the planar graph coloring problem using four-colors more efficiently and accurately. The simulation results show that proposed algorithm can get smaller average iterations than particle swarm optimization (PSO), differential evolution (DE), basic flower pollination algorithm (FPA), and can obtain higher successful coloring rate.