CHESS: A Structured Jump and Directed Line-Search Metaheuristic for Global Optimization

Metaheuristic optimization algorithms are powerful numerical tools for solving complex, high-dimensional problems. Population-based by design, they seek near-optimal solutions efficiently. Owing to their flexibility, metaheuristic algorithms are applicable across a wide range of optimization tasks. However, one of the key challenges they face is handling multi-dimensional functions. Numerous algorithms have been proposed to date, competing on speed, accuracy, and robustness. In this paper, several existing optimization algorithms are first reviewed. Then, a novel optimization algorithm inspired by the chess game is introduced, to predict the global optimum more accurately and efficiently. Various tuning parameters are proposed to adapt the algorithm to specific problems, enhancing both convergence speed and accuracy. A comparative evaluation against established methods shows that the proposed Chess Optimization (CHESS) algorithm is competitive in robustness, accuracy, and speed on the benchmark problems considered. These results are demonstrated on four representative benchmark functions with five independent runs per algorithm; extending the evaluation to larger-scale benchmark suites is discussed as future work.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-18
DOI
https://doi.org/10.21203/rs.3.rs-11597235/v1
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

CHESS: A Structured Jump and Directed Line-Search Metaheuristic for Global Optimization

Iman Hosseini, Mohammad Amin Behzadi
6 links
Research Square
Metaheuristic Optimization Algorithms Research
preprint

CHESS: A Structured Jump and Directed Line-Search Metaheuristic for Global Optimization

Iman Hosseini, Mohammad Amin Behzadi
preprint en

Abstract

Metaheuristic optimization algorithms are powerful numerical tools for solving complex, high-dimensional problems. Population-based by design, they seek near-optimal solutions efficiently. Owing to their flexibility, metaheuristic algorithms are applicable across a wide range of optimization tasks. However, one of the key challenges they face is handling multi-dimensional functions. Numerous algorithms have been proposed to date, competing on speed, accuracy, and robustness. In this paper, several existing optimization algorithms are first reviewed. Then, a novel optimization algorithm inspired by the chess game is introduced, to predict the global optimum more accurately and efficiently. Various tuning parameters are proposed to adapt the algorithm to specific problems, enhancing both convergence speed and accuracy. A comparative evaluation against established methods shows that the proposed Chess Optimization (CHESS) algorithm is competitive in robustness, accuracy, and speed on the benchmark problems considered. These results are demonstrated on four representative benchmark functions with five independent runs per algorithm; extending the evaluation to larger-scale benchmark suites is discussed as future work.

Research Square
Sharif University of Technology (IR), Shiraz University (IR)
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon