arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.17170cs.NEcs.AIcs.CLcs.LG
收藏

在二进制、排列和组合问题景观上对随机优化算法的基准测试

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

University of Saskatchewan(萨斯喀彻温大学);Delft University of Technology(代尔夫特理工大学)

Jethro Odeyemi, Wenjun Zhang

AI总结:

本文评估了RHC、SA、GA和MIMIC四种随机优化算法在二进制、排列和组合问题上的表现,分析了它们在解质量、收敛速度、计算成本和鲁棒性上的权衡,为根据问题类型和计算约束选择合适算法提供了实用指导。

摘要:

本文评估了四种随机优化算法的性能:随机化爬山(RHC)、模拟退火(SA)、遗传算法(GA)和MIMIC(互信息最大化输入聚类),涉及三类不同的问题:二进制、排列和组合问题。我们使用一组基准适应度函数系统地比较了这些算法,这些函数突出了每个问题类别的特定挑战和要求。我们的研究基于关键性能指标分析每种算法的有效性,包括解的质量、收敛速度、计算成本和鲁棒性。结果表明,虽然MIMIC和GA在为二进制和组合问题生成高质量解方面表现出色,但它们的计算需求差异显著。RHC和SA虽然计算成本较低,但在复杂问题景观中表现有限。这些发现为不同优化策略之间的权衡提供了有价值的见解,并为根据问题类型、准确性要求和计算约束选择合适的算法提供了实用指导。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑