Binary Hiking Optimization Algorithm

The Hiking Optimization Algorithm (HOA) is a newly designed metaheuristic optimization algorithm that stands out for its simplicity and problem-solving capability. Inspired by hiking, HOA draws parallels between the search landscapes of optimization problems and the rugged terrains encountered in nature. In this study, HOA is adapted for binary optimization problems, resulting in the proposal of the Binary Hiking Optimization Algorithm. The proposed algorithm, utilizing S-shaped and V-shaped transfer functions, is applied to Uncapaciated Facility Location Problems, and its performance is assessed. Key metrics such as mean, standard deviation, and GAP values are computed to evaluate the algorithm’s effectiveness. Furthermore, an improvement method for the location update strategy is proposed for HOA, inspired by the Moore neighborhood used in cellular automata. The experimental results demonstrate that the binary HOA, strengthened by appropriate transfer functions, serves as a robust approach to tackle complex binary optimization challenges.