Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
30,216
result(s) for
"Heuristic algorithms."
Sort by:
Hybrid Henry gas solubility optimization algorithm with dynamic cluster-to-algorithm mapping
This paper discusses a new variant of Henry Gas Solubility Optimization (HGSO) Algorithm, called Hybrid HGSO (HHGSO). Unlike its predecessor, HHGSO allows multiple clusters serving different individual meta-heuristic algorithms (i.e., with its own defined parameters and local best) to coexist within the same population. Exploiting the dynamic cluster-to-algorithm mapping via penalized and reward model with adaptive switching factor, HHGSO offers a novel approach for meta-heuristic hybridization consisting of Jaya Algorithm, Sooty Tern Optimization Algorithm, Butterfly Optimization Algorithm, and Owl Search Algorithm, respectively. The acquired results from the selected two case studies (i.e., involving team formation problem and combinatorial test suite generation) indicate that the hybridization has notably improved the performance of HGSO and gives superior performance against other competing meta-heuristic and hyper-heuristic algorithms.
Journal Article
A Comparative Study of Common Nature-Inspired Algorithms for Continuous Function Optimization
Over previous decades, many nature-inspired optimization algorithms (NIOAs) have been proposed and applied due to their importance and significance. Some survey studies have also been made to investigate NIOAs and their variants and applications. However, these comparative studies mainly focus on one single NIOA, and there lacks a comprehensive comparative and contrastive study of the existing NIOAs. To fill this gap, we spent a great effort to conduct this comprehensive survey. In this survey, more than 120 meta-heuristic algorithms have been collected and, among them, the most popular and common 11 NIOAs are selected. Their accuracy, stability, efficiency and parameter sensitivity are evaluated based on the 30 black-box optimization benchmarking (BBOB) functions. Furthermore, we apply the Friedman test and Nemenyi test to analyze the performance of the compared NIOAs. In this survey, we provide a unified formal description of the 11 NIOAs in order to compare their similarities and differences in depth and a systematic summarization of the challenging problems and research directions for the whole NIOAs field. This comparative study attempts to provide a broader perspective and meaningful enlightenment to understand NIOAs.
Journal Article
Metaheuristics for maritime operations
'Metaheuristic Algorithms in Maritime Operations' focuses on the seaside and port side problems regarding the maritime transportation. The book reviews and introduces the most important problems regarding the shipping network design, long-term and short-term scheduling and planning problems in both bulk and container shipping as well as liquid maritime transportation. Application of meta heuristic algorithm is important for these problems, as most of them are hard and time-consuming to be solved optimally.
Book
State-of-the-Art of Optimal Active and Reactive Power Flow: A Comprehensive Review from Various Standpoints
Optimal power flow (OPF), a mathematical programming problem extending power flow relationships, is one of the essential tools in the operation and control of power grids. To name but a few, the primary goals of OPF are to meet system demand at minimum production cost, minimum emission, and minimum voltage deviation. Being at the heart of power system problems for half a century, the OPF can be split into two significant categories, namely optimal active power flow (OAPF) and optimal reactive power flow (ORPF). The OPF is spontaneously a complicated non-linear and non-convex problem; however, it becomes more complex by considering different constraints and restrictions having to do with real power grids. Furthermore, power system operators in the modern-day power networks implement new limitations to the problem. Consequently, the OPF problem becomes more and more complex which can exacerbate the situation from mathematical and computational standpoints. Thus, it is crucially important to decipher the most appropriate methods to solve different types of OPF problems. Although a copious number of mathematical-based methods have been employed to handle the problem over the years, there exist some counterpoints, which prevent them from being a universal solver for different versions of the OPF problem. To address such issues, innovative alternatives, namely heuristic algorithms, have been introduced by many researchers. Inasmuch as these state-of-the-art algorithms show a significant degree of convenience in dealing with a variety of optimization problems irrespective of their complexities, they have been under the spotlight for more than a decade. This paper provides an extensive review of the latest applications of heuristic-based optimization algorithms so as to solve different versions of the OPF problem. In addition, a comprehensive review of the available methods from various dimensions is presented. Reviewing about 200 works is the most significant characteristic of this paper that adds significant value to its exhaustiveness.
Journal Article
Handbook of AI-based metaheuristics
\"At the heart of the optimization domain are mathematical modelling of the problem and the solution methodologies. In recent times, the problems are becoming larger, with growing complexity. Such problems are becoming cumbersome when handled by traditional optimization methods. This has motivated researchers to resort to Artificial Intelligence (AI) based nature-inspired solution methodologies or algorithms. The Handbook of AI-based Metaheuristics provides a wide-ranging reference to the theoretical and mathematical formulations of metaheuristics, including bio-inspired, swarm-based, socio-cultural and physics-based methods or algorithms; their testing and validation, along with detailed illustrative solutions and applications, as well as newly devised metaheuristic algorithms. The book will be a valuable reference to researchers from industry and academia, as well as Masters and PhD students around the globe working in the metaheuristics and applications domain\"-- Provided by publisher.
Book
A Quality-of-Service-Aware Service Composition Method in the Internet of Things Using a Multi-Objective Fuzzy-Based Hybrid Algorithm
The Internet of Things (IoT) represents a cutting-edge technical domain, encompassing billions of intelligent objects capable of bridging the physical and virtual worlds across various locations. IoT services are responsible for delivering essential functionalities. In this dynamic and interconnected IoT landscape, providing high-quality services is paramount to enhancing user experiences and optimizing system efficiency. Service composition techniques come into play to address user requests in IoT applications, allowing various IoT services to collaborate seamlessly. Considering the resource limitations of IoT devices, they often leverage cloud infrastructures to overcome technological constraints, benefiting from unlimited resources and capabilities. Moreover, the emergence of fog computing has gained prominence, facilitating IoT application processing in edge networks closer to IoT sensors and effectively reducing delays inherent in cloud data centers. In this context, our study proposes a cloud-/fog-based service composition for IoT, introducing a novel fuzzy-based hybrid algorithm. This algorithm ingeniously combines Ant Colony Optimization (ACO) and Artificial Bee Colony (ABC) optimization algorithms, taking into account energy consumption and Quality of Service (QoS) factors during the service selection process. By leveraging this fuzzy-based hybrid algorithm, our approach aims to revolutionize service composition in IoT environments by empowering intelligent decision-making capabilities and ensuring optimal user satisfaction. Our experimental results demonstrate the effectiveness of the proposed strategy in successfully fulfilling service composition requests by identifying suitable services. When compared to recently introduced methods, our hybrid approach yields significant benefits. On average, it reduces energy consumption by 17.11%, enhances availability and reliability by 8.27% and 4.52%, respectively, and improves the average cost by 21.56%.
Journal Article
A Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem
In this paper, we present a hybrid genetic-hierarchical algorithm for the solution of the quadratic assignment problem. The main distinguishing aspect of the proposed algorithm is that this is an innovative hybrid genetic algorithm with the original, hierarchical architecture. In particular, the genetic algorithm is combined with the so-called hierarchical (self-similar) iterated tabu search algorithm, which serves as a powerful local optimizer (local improvement algorithm) of the offspring solutions produced by the crossover operator of the genetic algorithm. The results of the conducted computational experiments demonstrate the promising performance and competitiveness of the proposed algorithm.
Journal Article
Cuckoo-PC: An Evolutionary Synchronization-Aware Placement of SDN Controllers for Optimizing the Network Performance in WSNs
Due to reliability and performance considerations, employing multiple software-defined networking (SDN) controllers is known as a promising technique in Wireless Sensor Networks (WSNs). Nevertheless, employing multiple controllers increases the inter-controller synchronization overhead. Therefore, optimal placement of SDN controllers to optimize the performance of a WSN, subject to the maximum number of controllers, determined based on the synchronization overhead, is a challenging research problem. In this paper, we first formulate this research problem as an optimization problem, then to address the optimization problem, we propose the Cuckoo Placement of Controllers (Cuckoo-PC) algorithm. Cuckoo-PC works based on the Cuckoo optimization algorithm which is a meta-heuristic algorithm inspired by nature. This algorithm seeks to find the global optimum by imitating brood parasitism of some cuckoo species. To evaluate the performance of Cuckoo-PC, we compare it against a couple of state-of-the-art methods, namely Simulated Annealing (SA) and Quantum Annealing (QA). The experiments demonstrate that Cuckoo-PC outperforms both SA and QA in terms of the network performance by lowering the average distance between sensors and controllers up to 13% and 9%, respectively. Comparing our method against Integer Linear Programming (ILP) reveals that Cuckoo-PC achieves approximately similar results (less than 1% deviation) in a noticeably shorter time.
Journal Article