女王蟻戦略を用いたACOに基づくグラフ彩色

抄録

Existing algorithms such as AS_elite and AS_rank^RS do not work well for Graph Coloring Problem (GCP) due to local search performance of each ant. This paper proposes Queen Ant Strategy for GCP which controls search intensification and diversification and makes it easier to implement in parallel than the existing algorithms.