{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:49:23Z","timestamp":1769442563680,"version":"3.49.0"},"reference-count":78,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T00:00:00Z","timestamp":1667174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics for cross-domain search with outstanding performances on six problem domains. However, it has recorded low performances on three supplementary problems, namely knapsack, quadratic assignment, and maximum-cut problems, which undermines its credibility across problem domains. The purpose of this study was to design an evolutionary algorithm-based iterated local search (EA-ILS) hyper-heuristic that applies a novel mutation operator to control the selection of perturbative low-level heuristics in searching for optimal sequences for performance improvement. The algorithm was compared to existing ones in the hyper-heuristics flexible (HyFlex) framework to demonstrate its performance across the problem domains of knapsack, quadratic assignment, and maximum cut. The comparative results have shown that the EA-ILS hyper-heuristic can obtain the best median objective function values on 22 out of 30 instances in the HyFlex framework. Moreover, it has achieved superiority in its generalization capability when compared to the reported top-performing hyper-heuristic algorithms.<\/jats:p>","DOI":"10.3390\/a15110405","type":"journal-article","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T23:26:32Z","timestamp":1667258792000},"page":"405","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Evolutionary Algorithm-Based Iterated Local Search Hyper-Heuristic for Combinatorial Optimization Problems"],"prefix":"10.3390","volume":"15","author":[{"given":"Stephen A.","family":"Adubi","sequence":"first","affiliation":[{"name":"Department of Computer and Information Sciences, Covenant University Ota, Ota 112104, Nigeria"}]},{"given":"Olufunke O.","family":"Oladipupo","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Covenant University Ota, Ota 112104, Nigeria"},{"name":"MICT SETA 4IR Center of Excellence, Durban University of Technology, Durban 4001, South Africa"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1633-7583","authenticated-orcid":false,"given":"Oludayo O.","family":"Olugbara","sequence":"additional","affiliation":[{"name":"MICT SETA 4IR Center of Excellence, Durban University of Technology, Durban 4001, South Africa"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,31]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"4937","DOI":"10.1007\/s10489-018-1250-y","article-title":"A Hyper-Heuristic with Two Guidance Indicators for Bi-Objective Mixed-Shift Vehicle Routing Problem with Time Windows","volume":"48","author":"Chen","year":"2018","journal-title":"Appl. Intell."},{"key":"ref_2","unstructured":"Chen, Y., Mourdjis, P., Polack, F., Cowling, P., and Remde, S. Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems. Proceedings of the Evolutionary Computation in Combinatorial Optimization."},{"key":"ref_3","unstructured":"Yska, D., Mei, Y., and Zhang, M. Genetic Programming Hyper-Heuristic with Cooperative Coevolution for Dynamic Flexible Job Shop Scheduling. Proceedings of the European Conference on Genetic Programming."},{"key":"ref_4","unstructured":"Park, J., Mei, Y., Nguyen, S., Chen, A., Johnston, M., and Zhang, M. Genetic Programming Based Hyper-Heuristics for Dynamic Job Shop Scheduling: Cooperative Coevolutionary Approaches. Proceedings of the European Conference on Genetic Programming."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Sabar, N.R., Turky, A., Song, A., and Sattar, A. (2017, January 5\u20138). Optimising Deep Belief Networks by Hyper-Heuristic Approach. Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia-San Sebasti\u00e1n, Spain.","DOI":"10.1109\/CEC.2017.7969640"},{"key":"ref_6","unstructured":"ul Hassan, M., Sabar, N.R., and Song, A. Optimising Deep Learning by Hyper-Heuristic Approach for Classifying Good Quality Images. Proceedings of the International Conference on Computational Science."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s12559-015-9368-2","article-title":"A Neuro-Evolutionary Hyper-Heuristic Approach for Constraint Satisfaction Problems","volume":"8","year":"2016","journal-title":"Cognit. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"13929","DOI":"10.1007\/s00500-020-04769-z","article-title":"An Evaluation of Monte Carlo-Based Hyper-Heuristic for Interaction Testing of Industrial Embedded Software Applications","volume":"24","author":"Ahmed","year":"2020","journal-title":"Soft Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"de Andrade, J., Silva, L., Britto, A., and Amaral, R. (2019, January 16\u201320). Solving the Software Project Scheduling Problem with Hyper-Heuristics. Proceedings of the International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland.","DOI":"10.1007\/978-3-030-20912-4_37"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3196831","article-title":"An Empirical Study of Meta- and Hyper-Heuristic Search for Multi-Objective Release Planning","volume":"27","author":"Zhang","year":"2018","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","article-title":"Recent Advances in Selection Hyper-Heuristics","volume":"285","author":"Drake","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Gendreau, M., and Potvin, J.-Y. (2019). A Classification of Hyper-Heuristic Approaches: Revisited. Handbook of Metaheuristics, Springer.","DOI":"10.1007\/978-3-319-91086-4"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Ortiz-Aguilar, L., Carpio, M., Rojas-Dom\u00ednguez, A., Ornelas-Rodriguez, M., Puga-Soberanes, H.J., and Soria-Alcaraz, J.A. (2021). A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems. Complexity, 6660572.","DOI":"10.1155\/2021\/6660572"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/TEVC.2021.3056143","article-title":"Correlation Coefficient-Based Recombinative Guidance for Genetic Programming Hyperheuristics in Dynamic Flexible Job Shop Scheduling","volume":"25","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Olivas, F., Amaya, I., Ortiz-Bayliss, J.C., Conant-Pablos, S.E., and Terashima-Mar\u00edn, H. (2021). Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic. Comput. Intell. Neurosci., 8834324.","DOI":"10.1155\/2021\/8834324"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"10515","DOI":"10.1109\/TCYB.2021.3065340","article-title":"Multitask Genetic Programming-Based Generative Hyperheuristics: A Case Study in Dynamic Scheduling","volume":"52","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Tapia-Avitia, J.M., Cruz-Duarte, J.M., Amaya, I., Ortiz-Bayliss, J.C., Terashima-Marin, H., and Pillay, N. (2022, January 18\u201323). A Primary Study on Hyper-Heuristics Powered by Artificial Neural Networks for Customising Population-Based Metaheuristics in Continuous Optimisation Problems. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy.","DOI":"10.1109\/CEC55065.2022.9870275"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","article-title":"A Deep Reinforcement Learning Based Hyper-Heuristic for Combinatorial Optimisation with Uncertainties","volume":"300","author":"Zhang","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","unstructured":"Ochoa, G., Hyde, M., Curtois, T., Vazquez-Rodriguez, J.A., Walker, J., Gendreau, M., Kendall, G., McCollum, B., Parkes, A.J., and Petrovic, S. HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search. Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization."},{"key":"ref_20","unstructured":"Misir, M., Verbeeck, K., De Causmaecker, P., and Berghe, G. Vanden An Intelligent Hyper-Heuristic Framework for CHeSC 2011. Proceedings of the International Conference on Learning and Intelligent Optimization."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Adriaensen, S., Brys, T., and Now\u00e9, A. (2014, January 12\u201316). Fair-Share ILS: A Simple State of the Art Iterated Local Search Hyperheuristic. Proceedings of the Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, Vancouver, BC, Canada.","DOI":"10.1145\/2576768.2598285"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Alanazi, F. (2016, January 6\u20139). Adaptive Thompson Sampling for Hyper-Heuristics. Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, Athens, Greece.","DOI":"10.1109\/SSCI.2016.7850086"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ferreira, A.S., Gon\u00e7alves, R.A., and Pozo, A. (2017, January 5\u20138). A Multi-Armed Bandit Selection Strategy for Hyper-Heuristics. Proceedings of the 2017 IEEE Congress on Evolutionary Computation, San Sebasti\u00e1n, Spain.","DOI":"10.1109\/CEC.2017.7969356"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Adriaensen, S., Ochoa, G., and Now\u00e9, A. (2015, January 25\u201328). A Benchmark Set Extension and Comparative Study for the HyFlex Framework. Proceedings of the 2015 IEEE Congress on Evolutionary Computation, Sandai, Japan.","DOI":"10.1109\/CEC.2015.7256971"},{"key":"ref_25","unstructured":"Almutairi, A., \u00d6zcan, E., Kheiri, A., and Jackson, W.G. Performance of Selection Hyper-Heuristics on the Extended HyFlex Domains. Proceedings of the International Symposium on Computer and Information Sciences."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"G\u00fcm\u00fc\u015f, D.B., \u00d6zcan, E., and Atkin, J. (2016, January 27\u201328). An Analysis of the Taguchi Method for Tuning a Memetic Algorithm with Reduced Computational Time Budget. Proceedings of the International Symposium on Computer and Information Sciences, Krakow, Poland.","DOI":"10.1007\/978-3-319-47217-1_2"},{"key":"ref_27","unstructured":"G\u00fcm\u00fc\u015f, D.B., \u00d6zcan, E., and Atkin, J. (2016, January 24\u201329). An Investigation of Tuning a Memetic Algorithm for Cross-Domain Search. Proceedings of the 2016 IEEE Congress on Evolutionary Computation, Vancouver, BC, Canada."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"105944","DOI":"10.1016\/j.knosys.2020.105944","article-title":"A Parallel Variable Neighborhood Search Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization","volume":"198","author":"Akbay","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.asoc.2018.11.029","article-title":"Modified Variable Neighborhood Search and Genetic Algorithm for Profitable Heterogeneous Vehicle Routing Problem with Cross-Docking","volume":"75","author":"Baniamerian","year":"2019","journal-title":"Appl. Soft Comput. J."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Tinos, R., Przewozniczek, M.W., and Whitley, D. (2022, January 9\u201313). Iterated Local Search with Perturbation Based on Variables Interaction for Pseudo-Boolean Optimization. Proceedings of the Proceedings of the Genetic and Evolutionary Computation Conference, Boston, MA, USA.","DOI":"10.1145\/3512290.3528716"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"11745","DOI":"10.1007\/s00521-019-04659-y","article-title":"ISA: A Hybridization between Iterated Local Search and Simulated Annealing for Multiple-Runway Aircraft Landing Problem","volume":"32","author":"Hammouri","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"ref_32","unstructured":"Gunawan, A., Lau, H.C., and Lu, K. An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows. Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.ejor.2014.02.020","article-title":"An Iterated Local Search Algorithm for the Single-Vehicle Cyclic Inventory Routing Problem","volume":"237","author":"Vansteenwegen","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.cor.2017.02.004","article-title":"A Multi-Start Iterated Local Search Algorithm for the Generalized Quadratic Multiple Knapsack Problem","volume":"83","author":"Avci","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2933","DOI":"10.1109\/TASE.2021.3097778","article-title":"Population-Based Iterated Local Search Approach for Dynamic Vehicle Routing Problems","volume":"19","author":"Sabar","year":"2021","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.cie.2018.04.032","article-title":"Iterated Local Search Algorithm with Ejection Chains for the Open Vehicle Routing Problem with Time Windows","volume":"120","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","article-title":"A Memory-Based Iterated Local Search Algorithm for the Multi-Depot Open Vehicle Routing Problem","volume":"284","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.asoc.2015.11.043","article-title":"Iterated Local Search Using an Add and Delete Hyper-Heuristic for University Course Timetabling","volume":"40","author":"Swan","year":"2016","journal-title":"Appl. Soft Comput. J."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.ejor.2017.01.042","article-title":"A Methodology for Determining an Effective Subset of Heuristics in Selection Hyper-Heuristics","volume":"260","author":"Ochoa","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.asoc.2018.04.034","article-title":"An Iterated Local Search Algorithm for the University Course Timetabling Problem","volume":"68","author":"Song","year":"2018","journal-title":"Appl. Soft Comput. J."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Kizys, R., Juan, A.A., Sawik, B., and Calvet, L. (2019). A Biased-Randomized Iterated Local Search Algorithm for Rich Portfolio Optimization. Appl. Sci., 9.","DOI":"10.3390\/app9173509"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"106136","DOI":"10.1016\/j.knosys.2020.106136","article-title":"A New Iterated Local Search Algorithm for the Cyclic Bandwidth Problem","volume":"203","author":"Ren","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1111\/itor.12547","article-title":"Iterated Local Search and Simulated Annealing Algorithms for the Inventory Routing Problem","volume":"25","author":"Alvarez","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1007\/s12597-020-00444-x","article-title":"An Effective Hybrid Local Search Approach for the Post Enrolment Course Timetabling Problem","volume":"57","author":"Goh","year":"2020","journal-title":"Opsearch"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Turky, A., Sabar, N.R., Sattar, A., and Song, A. (2017, January 10\u201313). Evolutionary Learning Based Iterated Local Search for Google Machine Reassignment Problems. Proceedings of the Asia-Pacific Conference on Simulated Evolution and Learning, Shenzhen, China.","DOI":"10.1007\/978-3-319-68759-9_34"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Hu, S., Liu, H., Wu, X., Li, R., Zhou, J., and Wang, J. (2019). A Hybrid Framework Combining Genetic Algorithm with Iterated Local Search for the Dominating Tree Problem. Mathematics, 7.","DOI":"10.3390\/math7040359"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1080\/0305215X.2019.1595611","article-title":"A Hybrid Iterated Local Search Algorithm with Adaptive Perturbation Mechanism by Success-History Based Parameter Adaptation for Differential Evolution (SHADE)","volume":"52","author":"Zhao","year":"2020","journal-title":"Eng. Optim."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Adubi, S.A., Oladipupo, O.O., and Olugbara, O.O. (July, January 28). Configuring the Perturbation Operations of an Iterated Local Search Algorithm for Cross-Domain Search: A Probabilistic Learning Approach. Proceedings of the 2021 IEEE Congress on Evolutionary Computation (CEC), Krak\u00f3w, Poland.","DOI":"10.1109\/CEC45853.2021.9504841"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ins.2018.01.005","article-title":"Automatic Design of Hyper-Heuristic Based on Reinforcement Learning","volume":"436","author":"Choong","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Duhart, B., Camarena, F., Ortiz-Bayliss, J.C., Amaya, I., and Terashima-Mar\u00edn, H. (2018, January 27\u201330). An Experimental Study on Ant Colony Optimization Hyper-Heuristics for Solving the Knapsack Problem. Proceedings of the Mexican Conference on Pattern Recognition, Puebla, Mexico.","DOI":"10.1007\/978-3-319-92198-3_7"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Sanchez-Diaz, X.F.C., Ortiz-Bayliss, J.C., Amaya, I., Cruz-Duarte, J.M., Conant-Pablos, S.E., and Terashima-Marin, H. (2020, January 19\u201324). A Preliminary Study on Feature-Independent Hyper-Heuristics for the 0\/1 Knapsack Problem. Proceedings of the 2020 IEEE Congress on Evolutionary Computation, Glasgow, UK.","DOI":"10.1109\/CEC48606.2020.9185671"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-D\u00edaz, X., Ortiz-Bayliss, J.C., Amaya, I., Cruz-Duarte, J.M., Conant-Pablos, S.E., and Terashima-Mar\u00edn, H. (2021). A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem. Appl. Sci., 11.","DOI":"10.3390\/app112110209"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Olivas, F., Amaya, I., Ortiz-Bayliss, J.C., Conant-Pablos, S.E., and Terashima-Marin, H. (2020, January 19\u201324). A Fuzzy Hyper-Heuristic Approach for the 0-1 Knapsack Problem. Proceedings of the 2020 IEEE Congress on Evolutionary Computation, Glasgow, UK.","DOI":"10.1109\/CEC48606.2020.9185710"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","article-title":"Solving 0\u20131 Knapsack Problem by a Novel Binary Monarch Butterfly Optimization","volume":"28","author":"Feng","year":"2017","journal-title":"Neural Comput. Appl."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","article-title":"New Binary Bat Algorithm for Solving 0\u20131 Knapsack Problem","volume":"4","author":"Hassanien","year":"2018","journal-title":"Complex Intell. Syst."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s13042-017-0731-3","article-title":"A Modified Nature Inspired Meta-Heuristic Whale Optimization Algorithm for Solving 0\u20131 Knapsack Problem","volume":"10","author":"Sangaiah","year":"2019","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"54447","DOI":"10.1109\/ACCESS.2018.2872533","article-title":"List-Based Simulated Annealing Algorithm with Hybrid Greedy Repair and Optimization Operator for 0-1 Knapsack Problem","volume":"6","author":"Zhan","year":"2018","journal-title":"IEEE Access"},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"104982","DOI":"10.1109\/ACCESS.2019.2930638","article-title":"A Discrete Improved Artificial Bee Colony Algorithm for 0-1 Knapsack Problem","volume":"7","author":"Zhang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"43979","DOI":"10.1109\/ACCESS.2019.2908489","article-title":"A Comparative Study of Meta-Heuristic Optimization Algorithms for 0-1 Knapsack Problem: Some Initial Results","volume":"7","author":"Ezugwu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Senzaki, B.N., Venske, S.M., and Almeida, C.P. (2020, January 20\u201323). Multi-Objective Quadratic Assignment Problem: An Approach Using a Hyper-Heuristic Based on the Choice Function. Proceedings of the Brazilian Conference on Intelligent Systems, Rio Grande, Brazil.","DOI":"10.1007\/978-3-030-61377-8_10"},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Chmiel, W., and Kwiecie\u0144, J. (2018). Quantum-Inspired Evolutionary Approach for the Quadratic Assignment Problem. Entropy, 20.","DOI":"10.3390\/e20100781"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.asoc.2018.08.047","article-title":"Integrating the Whale Algorithm with Tabu Search for Quadratic Assignment Problem: A New Approach for Locating Hospital Departments","volume":"73","author":"Manogaran","year":"2018","journal-title":"Appl. Soft Comput. J."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ins.2020.06.036","article-title":"A Hybrid Method Integrating an Elite Genetic Algorithm with Tabu Search for the Quadratic Assignment Problem","volume":"539","author":"Zhang","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.asoc.2019.01.001","article-title":"Artificial Bee Colony Optimization for the Quadratic Assignment Problem","volume":"76","author":"Dokeroglu","year":"2019","journal-title":"Appl. Soft Comput. J."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Misevi\u010dius, A., and Veren\u0117, D. (2021). A Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem. Entropy, 23.","DOI":"10.3390\/e23010108"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.asoc.2015.04.033","article-title":"A Tabu Search Based Hybrid Evolutionary Algorithm for the Max-Cut Problem","volume":"34","author":"Wu","year":"2015","journal-title":"Appl. Soft Comput. J."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Chen, X., Lin, G., and Xu, M. (2019, January 19\u201321). Applying a Binary Artificial Bee Colony Algorithm to the Max-Cut Problem. Proceedings of the Proceedings-2019 12th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics, Suzhou, China.","DOI":"10.1109\/CISP-BMEI48845.2019.8965831"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.swevo.2018.01.004","article-title":"A Comparison Study of Harmony Search and Genetic Algorithm for the Max-Cut Problem","volume":"44","author":"Kim","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_69","doi-asserted-by":"crossref","unstructured":"Barrett, T.D., Clements, W.R., Foerster, J.N., and Lvovsky, A.I. (2020, January 7\u201312). Exploratory Combinatorial Optimization with Reinforcement Learning. Proceedings of the 34th AAAI Conference on Artificial Intelligence, New York, NY, USA.","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Kheiri, A., and Keedwell, E. (2015, January 11\u201315). A Sequence-Based Selection Hyper-Heuristic Utilising a Hidden Markov Model. Proceedings of the GECCO 2015-Proceedings of the 2015 Genetic and Evolutionary Computation Conference, Madrid, Spain.","DOI":"10.1145\/2739480.2754766"},{"key":"ref_71","unstructured":"Zhao, Y., Leng, L., and Zhang, C. (2021). A Novel Framework of Hyper-Heuristic Approach and Its Application in Location-Routing Problem with Simultaneous Pickup and Delivery, Springer."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"107010","DOI":"10.1016\/j.cie.2020.107010","article-title":"A Hyper Heuristic for the Green Vehicle Routing Problem with Simultaneous Pickup and Delivery","volume":"153","author":"Olgun","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ins.2014.12.020","article-title":"A Tensor-Based Selection Hyper-Heuristic for Cross-Domain Heuristic Search","volume":"299","author":"Asta","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/TEVC.2014.2319051","article-title":"Automatic Design of Hyper-Heuristic Framework with Gene Expression Programming for Combinatorial Optimization Problems","volume":"19","author":"Sabar","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2015.09.003","article-title":"An Iterated Multi-Stage Selection Hyper-Heuristic","volume":"250","author":"Kheiri","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","article-title":"QAPLIB\u2013a Quadratic Assignment Problem Library","volume":"10","author":"Burkard","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_77","first-page":"124970","article-title":"A Novel Formulation of the Max-Cut Problem and Related Algorithm","volume":"371","author":"Yang","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Gendreau, M., and Potvin, J.-Y. (2019). Iterated Local Search: Framework and Applications. Handbook of Metaheuristics, Springer.","DOI":"10.1007\/978-3-319-91086-4"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/11\/405\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:06:48Z","timestamp":1760144808000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/11\/405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,31]]},"references-count":78,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2022,11]]}},"alternative-id":["a15110405"],"URL":"https:\/\/doi.org\/10.3390\/a15110405","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,31]]}}}