Next Article in Journal
Improved Directional Mutation Moth–Flame Optimization Algorithm via Gene Modification for Automatic Reverse Parking Trajectory Optimization
Next Article in Special Issue
Plane Frame Structures: Optimization and Design Solutions Clustering
Previous Article in Journal
A Regret-Enhanced DEA Approach to Mapping Renewable Energy Efficiency in Asia’s Growth Economies
Previous Article in Special Issue
Inverse Kinematics of Robotic Manipulators Based on Hybrid Differential Evolution and Jacobian Pseudoinverse Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Deep Learning-Based Step Size Determination for Hill Climbing Metaheuristics

by
Sándor Szénási
1,2,*,†,
Gábor Légrádi
1,† and
Gábor Kovács
1,†
1
John von Neumann Faculty of Informatics, Óbuda University, 1034 Budapest, Hungary
2
Faculty of Economics and Informatics, J. Selye University, 945 01 Komarno, Slovakia
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Algorithms 2025, 18(5), 298; https://doi.org/10.3390/a18050298
Submission received: 30 April 2025 / Revised: 17 May 2025 / Accepted: 19 May 2025 / Published: 21 May 2025
(This article belongs to the Special Issue Bio-Inspired Algorithms: 2nd Edition)

Abstract

Machine Learning-assisted metaheuristics is a new and promising research topic, combining the advantages of both method families. Metaheuristics are widely used general problem solvers that can be fine-tuned by prior knowledge about the search space; however, this adaptation can be a very time-consuming and complex task. This paper proposes a hybrid variation of the Hill Climbing method using a Machine Learning model to learn this domain-specific knowledge in advance to help determine the optimal step size of each iteration. A Deep Feedforward Neural Network was trained on the steps of thousands of Hill Climbing runs. This model was used in a novel alternating method (using traditional and Machine Learning-based steps) to predict the optimal step size for each iteration. This hybrid algorithm was compared to the already-known variants. The results show that the novel hybrid method is able to find slightly better results than the original Hill Climbing method, requiring significantly fewer fitness calculations.
Keywords: machine learning; metaheuristics; hill climbing; optimization; optimal step-size; epsilon value machine learning; metaheuristics; hill climbing; optimization; optimal step-size; epsilon value

Share and Cite

MDPI and ACS Style

Szénási, S.; Légrádi, G.; Kovács, G. Deep Learning-Based Step Size Determination for Hill Climbing Metaheuristics. Algorithms 2025, 18, 298. https://doi.org/10.3390/a18050298

AMA Style

Szénási S, Légrádi G, Kovács G. Deep Learning-Based Step Size Determination for Hill Climbing Metaheuristics. Algorithms. 2025; 18(5):298. https://doi.org/10.3390/a18050298

Chicago/Turabian Style

Szénási, Sándor, Gábor Légrádi, and Gábor Kovács. 2025. "Deep Learning-Based Step Size Determination for Hill Climbing Metaheuristics" Algorithms 18, no. 5: 298. https://doi.org/10.3390/a18050298

APA Style

Szénási, S., Légrádi, G., & Kovács, G. (2025). Deep Learning-Based Step Size Determination for Hill Climbing Metaheuristics. Algorithms, 18(5), 298. https://doi.org/10.3390/a18050298

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop