Results 61 to 70 of about 715 (165)

Optimizing MPPT Control for Enhanced Efficiency in Sustainable Photovoltaic Microgrids: A DSO‐Based Approach

open access: yesInternational Transactions on Electrical Energy Systems, Volume 2024, Issue 1, 2024.
The output of photovoltaic (PV) systems is significantly impacted by the vagaries of ambient temperature, solar irradiance, and environmental fluctuations. To achieve the utmost attainable power from PV systems, it is desired to be efficient at the maximum power point in diverse weather climates.
Debabrata Mazumdar   +6 more
wiley   +1 more source

A Stochastic Hyperheuristic for Unsupervised Matching of Partial Information [PDF]

open access: yesAdvances 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]

open access: yesThe 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

A multi-arm bandit neighbourhood search for routing and scheduling problems [PDF]

open access: yes, 2016
Local search based meta-heuristics such as variable neighbourhood search have achieved remarkable success in solving complex combinatorial problems.
Chen, Yujie   +3 more
core  

Hybridizations within a graph based hyper-heuristic framework for university timetabling problems [PDF]

open access: yes, 2008
A significant body of recent literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph-based hyper-heuristic (
Burke, Edmund, Qu, Rong
core   +2 more sources

Wind Farm Layout Optimization Problem Using Nature‐Inspired Algorithms

open access: yesJournal 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

Automated Course Timetabling Optimization Using Tabu-Simulated Annealing Hyper-Heuristics Algorithm

open access: yesKhazanah Informatika
The topic of solving Timetabling Problems is an interesting area of study. These problems are commonly encountered in many institutions, particularly in the educational sector, including universities.
Ahmad Muklason   +2 more
doaj   +1 more source

Multi-Agent Based Hyper-Heuristics for Multi-Objective Flexible Job Shop Scheduling: A Case Study in an Aero-Engine Blade Manufacturing Plant

open access: yesIEEE Access, 2019
In the paper, a case study focusing on multi-objective flexible job shop scheduling problem (MO-FJSP) in an aero-engine blade manufacturing plant is presented. The problem considered in this paper involves many attributes, including working calendar, due
Yong Zhou, Jian-Jun Yang, Lian-Yu Zheng
doaj   +1 more source

Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling [PDF]

open access: yes, 2009
Examination Timetabling Problem (ETTP) is an NP-hard typical optimization problem faced by institutions and universities across the world. This nature leads to heuristic methods cover a large branch of researches in this area.
Mohammad Pour, Shahrzad
core  

A time predefined variable depth search for nurse rostering [PDF]

open access: yes, 2013
This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves.
Abdullah S   +40 more
core   +3 more sources

Home - About - Disclaimer - Privacy