{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:19:25Z","timestamp":1760059165219,"version":"build-2065373602"},"reference-count":38,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T00:00:00Z","timestamp":1748304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LY22F020019","LGG22F020032","61972359","62132014"],"award-info":[{"award-number":["LY22F020019","LGG22F020032","61972359","62132014"]}]},{"name":"Public-welfare Technology Application Research of Zhejiang Province in China","award":["LY22F020019","LGG22F020032","61972359","62132014"],"award-info":[{"award-number":["LY22F020019","LGG22F020032","61972359","62132014"]}]},{"name":"Zhejiang Science and Technology Plan Project","award":["LY22F020019","LGG22F020032","61972359","62132014"],"award-info":[{"award-number":["LY22F020019","LGG22F020032","61972359","62132014"]}]},{"name":"National Natural Science Foundation of China","award":["LY22F020019","LGG22F020032","61972359","62132014"],"award-info":[{"award-number":["LY22F020019","LGG22F020032","61972359","62132014"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Metaheuristic algorithms, due to their superior global exploration capabilities and applicability, have emerged as critical tools for addressing complicated optimization tasks. However, these algorithms commonly depend on expert knowledge to configure parameters and design strategies. As a result, they frequently lack appropriate automatic behavior adjustment methods for dealing with changing problem features or dynamic search phases, limiting their adaptability, search efficiency, and solution quality. To address these limitations, this paper proposes an automated hybrid metaheuristic algorithm generation method based on Learning to Rank (LTR-MHA). The LTR-MHA aims to achieve adaptive optimization of algorithm combination strategies by dynamically fusing the search behaviors of Whale Optimization (WOA), Harris Hawks Optimization (HHO), and the Genetic Algorithm (GA). At the core of the LTR-MHA is the utilization of Learning-to-Rank techniques to model the mapping between problem features and algorithmic behaviors, to assess the potential of candidate solutions in real-time, and to guide the algorithm to make better decisions in the search process, thereby achieving a well-adjusted balance between the exploration and exploitation stages. The effectiveness and efficiency of the LTR-MHA method are evaluated using the CEC2017 benchmark functions. The experiments confirm the effectiveness of the proposed method. It delivers superior results compared to individual metaheuristic algorithms and random combinatorial strategies. Notable improvements are seen in average fitness, solution precision, and overall stability. Our approach offers a promising direction for efficient search capabilities and adaptive mechanisms in automated algorithm design.<\/jats:p>","DOI":"10.3390\/a18060316","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T05:52:52Z","timestamp":1748325172000},"page":"316","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Generation of Hybrid Metaheuristics Using Learning-to-Rank"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0430-1769","authenticated-orcid":false,"given":"Xinru","family":"Xue","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5222-7608","authenticated-orcid":false,"given":"Ting","family":"Shu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinsong","family":"Xia","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TEVC.2022.3197298","article-title":"Automated design of metaheuristics using reinforcement learning within a novel general search framework","volume":"27","author":"Yi","year":"2022","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"119639","DOI":"10.1016\/j.ins.2023.119639","article-title":"Automated design of search algorithms based on reinforcement learning","volume":"649","author":"Yi","year":"2023","journal-title":"Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.12962\/jaree.v6i1.216","article-title":"Metaheuristic algorithms in optimization and its application: A review","volume":"6","author":"Kareem","year":"2022","journal-title":"JAREE"},{"key":"ref_5","unstructured":"Wang, S., Lo, D., Jiang, L., and Lau, H.C. (2011, January 6\u201310). Search-based fault localization. Proceedings of the 26th IEEE\/ACM International Conference on Automated Software Engineering, Lawrence, KS, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.future.2018.07.062","article-title":"QoS-aware cloud service composition using eagle strategy","volume":"90","author":"Gavvala","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"100551","DOI":"10.1016\/j.dajour.2025.100551","article-title":"A comprehensive review of dwarf mongoose optimization algorithm with emerging trends and future research directions","volume":"14","author":"Abraham","year":"2025","journal-title":"Decis. Anal. J."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Bian, H., Li, C., Liu, Y., Tong, Y., Bing, S., Chen, J., and Zhang, Z. (2025). Improved snow geese algorithm for engineering applications and clustering optimization. Sci. Rep., 15.","DOI":"10.1038\/s41598-025-88080-7"},{"key":"ref_9","unstructured":"Ryser-Welch, P., and Miller, J.F. (2014, January 1\u20134). A review of hyper-heuristic frameworks. Proceedings of the Evo20 Workshop, AISB, London, UK."},{"key":"ref_10","first-page":"1","article-title":"Machine learning into metaheuristics: A survey and taxonomy","volume":"54","author":"Talbi","year":"2021","journal-title":"ACM Comput. Surv."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Becerra-Rozas, M., Lemus-Romani, J., Crawford, B., Soto, R., Cisternas-Caneo, F., Embry, A.T., Molina, M.A., Tapia, D., Castillo, M., and Misra, S. (2021, January 13\u201316). Reinforcement learning based whale optimizer. Proceedings of the International Conference on Computational Science and Its Applications, Cagliari, Italy.","DOI":"10.1007\/978-3-030-87013-3_16"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/TEVC.2023.3234269","article-title":"Interactive evolutionary multiobjective optimization via learning to rank","volume":"27","author":"Li","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"103411","DOI":"10.1016\/j.advengsoft.2023.103411","article-title":"A reinforcement learning-based metaheuristic algorithm for solving global optimization problems","volume":"178","author":"Seyyedabbasi","year":"2023","journal-title":"Adv. Eng. Softw."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Talbi, E.-G. (2013). A unified taxonomy of hybrid metaheuristics with mathematical programming, constraint programming and machine learning. Hybrid Metaheuristics, Springer.","DOI":"10.1007\/978-3-642-30671-6_1"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1007\/s10845-015-1080-2","article-title":"Correlation-aware QoS modeling and manufacturing cloud service composition","volume":"28","author":"Jin","year":"2017","journal-title":"J. Intell. Manuf."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"108053","DOI":"10.1016\/j.asoc.2021.108053","article-title":"Eagle strategy using uniform mutation and modified whale optimization algorithm for QoS-aware cloud service composition","volume":"114","author":"Jin","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Lu, Y., Yi, C., Li, J., and Li, W. (2023, January 17\u201318). An Enhanced Opposition-Based Golden-Sine Whale Optimization Algorithm. Proceedings of the International Conference on Cognitive Computing, Shenzhen, China.","DOI":"10.1007\/978-3-031-51671-9_5"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Semenikhin, S.V., and Denisova, L.A. (2016, January 15\u201317). Learning to rank based on modified genetic algorithm. Proceedings of the 2016 Dynamics of Systems, Mechanisms and Machines (Dynamics), Omsk, Russia.","DOI":"10.1109\/Dynamics.2016.7819080"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3743","DOI":"10.1007\/s13042-022-01623-6","article-title":"A hyper-heuristic guided by a probabilistic graphical model for single-objective real-parameter optimization","volume":"13","author":"Oliva","year":"2022","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.ejor.2023.01.017","article-title":"A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems","volume":"309","author":"Kallestad","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Hsieh, F.-S. (2025). Creating Effective Self-Adaptive Differential Evolution Algorithms to Solve the Discount-Guaranteed Ridesharing Problem Based on a Saying. Appl. Sci., 15.","DOI":"10.3390\/app15063144"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Hsieh, F.-S. (2024). Applying \u201cTwo Heads Are Better Than One\u201d Human Intelligence to Develop Self-Adaptive Algorithms for Ridesharing Recommendation Systems. Electronics, 13.","DOI":"10.3390\/electronics13122241"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Xu, T., and Chen, C. (2025). DBO-AWOA: An Adaptive Whale Optimization Algorithm for Global Optimization and UAV 3D Path Planning. Sensors, 25.","DOI":"10.3390\/s25072336"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"119529","DOI":"10.1016\/j.eswa.2023.119529","article-title":"Genetic Algorithms with Self-Adaptation for Predictive Classification of Medicare Standardized Payments for Physical Therapists","volume":"218","author":"Norat","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_25","unstructured":"Wu, G., Mallipeddi, R., and Suganthan, P.N. (2017). Problem Definitions and Evaluation Criteria for the CEC 2017 Competition on Constrained Real-Parameter Optimization, Nanyang Technological University. Available online: https:\/\/www.researchgate.net\/publication\/317228117_Problem_Definitions_and_Evaluation_Criteria_for_the_CEC_2017_Competition_and_Special_Session_on_Constrained_Single_Objective_Real-Parameter_Optimization."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","article-title":"The whale optimization algorithm","volume":"95","author":"Mirjalili","year":"2016","journal-title":"Adv. Eng. Softw."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","article-title":"Harris hawks optimization: Algorithm and applications","volume":"97","author":"Heidari","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","article-title":"Genetic algorithms","volume":"267","author":"Holland","year":"1992","journal-title":"Sci. Am."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., and Hullender, G. (2005, January 7\u201311). Learning to rank using gradient descent. Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany.","DOI":"10.1145\/1102351.1102363"},{"key":"ref_30","unstructured":"Li, P., Wu, Q., and Burges, C. (2007, January 3\u20136). McRank: Learning-to-rank using multiple classification and gradient boosting. Proceedings of the 20th International Conference on Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Crammer, K., and Singer, Y. (2001). Pranking with ranking. Advances in Neural Information Processing Systems, MIT Press.","DOI":"10.7551\/mitpress\/1120.003.0087"},{"key":"ref_32","first-page":"933","article-title":"An efficient boosting algorithm for combining preferences","volume":"4","author":"Freund","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., and Li, H. (2007, January 20\u201324). Learning to rank: From pairwise approach to listwise approach. Proceedings of the 24th International Conference on Machine Learning, Corvallis, OR, USA.","DOI":"10.1145\/1273496.1273513"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"100671","DOI":"10.1016\/j.swevo.2020.100671","article-title":"A better balance in metaheuristic algorithms: Does it exist?","volume":"54","author":"Zaldivar","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s10462-018-09676-2","article-title":"From ants to whales: Metaheuristics for all tastes","volume":"53","author":"Fausto","year":"2020","journal-title":"Artif. Intell. Rev."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","article-title":"The (black) art of runtime evaluation: Are we comparing algorithms or implementations?","volume":"52","author":"Kriegel","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Plevris, V., and Solorzano, G. (2022). A collection of 30 multidimensional functions for global optimization benchmarking. Data, 7.","DOI":"10.3390\/data7040046"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"101378","DOI":"10.1016\/j.swevo.2023.101378","article-title":"Choice of benchmark optimization problems does matter","volume":"83","author":"Piotrowski","year":"2023","journal-title":"Swarm Evol. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/6\/316\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:41:10Z","timestamp":1760031670000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/6\/316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,27]]},"references-count":38,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["a18060316"],"URL":"https:\/\/doi.org\/10.3390\/a18060316","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,5,27]]}}}