IJGI, Vol. 12, Pages 429: A Hybrid Discrete Artificial Bee Colony Algorithm Based on Label Similarity for Solving Point-Feature Label Placement Problem

IJGI, Vol. 12, Pages 429: A Hybrid Discrete Artificial Bee Colony Algorithm Based on Label Similarity for Solving Point-Feature Label Placement Problem

ISPRS International Journal of Geo-Information doi: 10.3390/ijgi12100429

Authors: Wen Cao Jiaqi Xu Yong Zhang Siqi Zhao Chu Xu Xiaofeng Wu

The artificial bee colony algorithm (ABC) is a promising metaheuristic algorithm for continuous optimization problems, but it performs poorly in solving discrete problems. To address this issue, this paper proposes a hybrid discrete artificial bee colony (HDABC) algorithm based on label similarity for the point-feature label placement (PFLP) problem. Firstly, to better adapt to PFLP, we have modified the update mechanism for employed bees and onlooker bees. Employed bees learn the label position of the better individuals, while onlooker bees perform dynamic probability searches using two neighborhood operators. Additionally, the onlooker bees’ selection method selects the most promising solutions based on label similarity, which improves the algorithm’s search capabilities. Finally, the Metropolis acceptance strategy is replaced by the original greedy acceptance strategy to avoid the premature convergence problem. Systematic experiments are conducted to verify the effectiveness of the neighborhood solution generation method, the selection operation based on label similarity, and the Metropolis acceptance strategy in this paper. In addition, experimental comparisons were made at different instances and label densities. The experimental results show that the algorithm proposed in this paper is better or more competitive with the compared algorithm.