Benchmarking Randomized Optimization Algorithms On Binary Permutation And Combinatorial Problem Landscapes

# Benchmarking Randomized Optimization Algorithms on Binary, Permutation, and Combinatorial Problem Landscapes

**arXiv ID:** 2501.17170
**Authors:** Jethro Odeyemi, Wenjun Zhang
**Published:** 2025-01-21T23:13:01Z
**Abstract:**
In this paper, we evaluate the performance of four randomized optimization algorithms: Randomized Hill Climbing (RHC), Simulated Annealing (SA), Genetic Algorithms (GA), and MIMIC (Mutual Information Maximizing Input Clustering), across three distinct types of problems: binary, permutation, and combinatorial. We systematically compare these algorithms using a set of benchmark fitness functions that highlight the specific challenges and requirements of each problem category. Our study analyzes each algorithm's effectiveness based on key performance metrics, including solution quality, convergence speed, computational cost, and robustness. Results show that while MIMIC and GA excel in producing high-quality solutions for binary and combinatorial problems, their computational demands vary significantly. RHC and SA, while computationally less expensive, demonstrate limited performance in complex problem landscapes. The findings offer valuable insights into the trade-offs between different optimization strategies and provide practical guidance for selecting the appropriate algorithm based on the type of problems, accuracy requirements, and computational constraints.

## Skill Description

This skill is generated from the arXiv paper: Benchmarking Randomized Optimization Algorithms on Binary, Permutation, and Combinatorial Problem Landscapes (2501.17170).

## How to Use

[To be filled in by the user or by future automation]

## References

- [arXiv:2501.17170](http://arxiv.org/abs/2501.17170v1)