Results 71 to 80 of about 1,136 (193)
Hyper-Heuristic Capacitance Array Method for Multi-Metal Wear Debris Detection
Sensors, 2019 Online detection of fatigued wear debris in the lubricants of aero-engines can provide warning of engine failure during flight, thus having great economic and social benefits.
Yanshan Sun, Lecheng Jia, Zhoumo Zeng
doaj +1 more source
Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems
IEEE Access, 2022 Hyper-heuristics (HHs) stand as a relatively recent approach to solving optimization problems. There are different kinds of HHs. One of them deals with how low-level heuristics must be combined to deliver an improved solution to a set of problem ...
Alonso Vela +3 more
doaj +1 more source
Wind Farm Layout Optimization Problem Using Nature‐Inspired Algorithms
Journal of Electrical and Computer Engineering, Volume 2024, Issue 1, 2024.The wind farm layout optimization problem (WFLOP) is a significant problem in the field of renewable energy. In this development of wind farm, solving the WFLOP is a crucial task, which entails placing the turbines in the wind farm in the best locations to reduce wake effects and enhance predicted power generation.
Mukesh Kumar +5 more
wiley +1 more source
A Stochastic Hyperheuristic for Unsupervised Matching of Partial Information [PDF]
Advances in Artificial Intelligence, 2012 This paper (Revised version of a white paper “Unsupervised Problem-Solving by Optimising through Comparisons,” originally published on DCS and Scribd, October 2011.) describes the implementation and functionality of a centralised problem solving system that is included as part of the distributed “licas” system.
openaire +1 more source
HYPERDOCK: Improving virtual screening through parallel hyperheuristics [PDF]
The International Journal of High Performance Computing Applications, 2019 Virtual screening (VS) methods aid clinical research by predicting the interaction of ligands with pharmacological targets. The computational requirements of VS, along with the size of the databases, propitiate the use of high-performance computing. METADOCK is a tool for the application of metaheuristics to VS in heterogeneous clusters of computers ...
Baldomero Imbernón +3 more
openaire +2 more sources
B∗ Algorithm: Multiobjective Path Planning for Flexible Buses Traffic System
Journal of Advanced Transportation, Volume 2024, Issue 1, 2024.Advances in vehicle intelligence have ushered in the rapid development of intelligent connected vehicles and the emergence of the Internet of Vehicles (IoV), greatly improving the passenger travel experience. However, as a new mode of transport, flexible public transportation presents challenges for operators in terms of reducing costs and improving ...
Zhida Ke +9 more
wiley +1 more source
Ensemble move acceptance in selection hyper-heuristics [PDF]
, 2016 Selection hyper-heuristics are high level search methodologies which control a set of low level heuristics while solving a given problem. Move acceptance is a crucial component of selection hyper-heuristics, deciding whether to accept or reject a new ...
Kheiri, Ahmed +2 more
core +1 more source
A Hyper-Heuristic Algorithm for Time-Dependent Green Location Routing Problem With Time Windows
IEEE Access, 2020 The Location Routing Problem (LRP), a branch of logistics management, has been addressed in many research papers. However, there are few papers on time-dependent LRP. And only a few of them take fuel consumption into consideration.
Chunmiao Zhang +2 more
doaj +1 more source
Improved decision support for engine-in-the-loop experimental design optimization [PDF]
, 2009 Experimental optimization with hardware in the loop is a common procedure in engineering and has been the subject of intense development, particularly when it is applied to relatively complex combinatorial systems that are not completely understood, or ...
Chen, R. +4 more
core +3 more sources
Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2020 Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem.
Gabriella Icasia +2 more
doaj +1 more source