Explore the vast range of titles available.

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.

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%.

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.

For 5G and future Internet, in this paper, we propose a task allocation method for future Internet application to reduce the total latency in a mobile edge computing (MEC) platform with three types of servers: a dedicated MEC server, a shared MEC server, and a cloud server. For this platform, we first calculate the delay between sending a task and receiving a response for the dedicated MEC server, shared MEC server, and cloud server by considering the processing time and transmission delay. Here, the transmission delay for the shared MEC server is derived using queueing theory. Then, we formulate an optimization problem for task allocation to minimize the total latency for all tasks. By solving this optimization problem, tasks can be allocated to the MEC servers and cloud server appropriately. In addition, we propose a heuristic algorithm to obtain the approximate optimal solution in a shorter time. This heuristic algorithm consists of four algorithms: a main algorithm and three additional algorithms. In this algorithm, tasks are divided into two groups, and task allocation is executed for each group. We compare the performance of our proposed heuristic algorithm with the solution obtained by three other methods and investigate the effectiveness of our algorithm. Numerical examples are used to demonstrate the effectiveness of our proposed heuristic algorithm. From some results, we observe that our proposed heuristic algorithm can perform task allocation in a short time and can effectively reduce the total latency in a short time. We conclude that our proposed heuristic algorithm is effective for task allocation in a MEC platform with multiple types of MEC servers.

Implementing green and sustainable development strategies has become essential for industrial robot manufacturing companies to fulfill their societal obligations. By enhancing assembly efficiency and minimizing energy consumption in workshops, these enterprises can differentiate themselves in the fiercely competitive market landscape and ultimately bolster their financial gains. Consequently, this study focuses on examining the collaborative assembly challenges associated with three crucial parts: the body, electrical cabinet, and pipeline pack, within the industrial robot manufacturing process. Considering the energy consumption during both active and idle periods of the industrial robot workshop assembly system, this paper presents a multi-stage energy-efficient scheduling model to minimize the total energy consumption. Two classes of heuristic algorithms are proposed to address this model. Our contribution is the restructuring of the existing complex mathematical programming model, based on the structural properties of scheduling sub-problems across multiple stages. This reformation not only effectively reduces the variable scale and eliminates redundant constraints, but also enables the Gurobi solver to tackle large-scale problems. Extensive experimental results indicate that compared to traditional workshop experience, the constructed green scheduling model and algorithm can provide more precise guidance for the assembly process in the workshop. Regarding total energy consumption, the assembly plans obtained through our designed model and algorithm exhibit approximately 3% lower energy consumption than conventional workshop experience-based approaches.

In the context of a low-carbon economy, scientific methods to reduce carbon emissions have become an important issue for many ports. Carbon emissions in port areas mainly arise from vessels and handling equipment. Therefore, an effective resource assignment and equipment arrangement system could not only reduce carbon emissions, but also improve the port’s operational efficiency. This study considers factors such as the arrival order of container trailers, the cargo weight, and the number of container rehandling operations. The objective is to minimize the carbon emissions and the number of container rehandling operations in ports, for which a mixed-integer linear programming model is built. Both heuristic algorithms and hyper-heuristic algorithms are employed to optimize the container storage plan, and their applicability in storage optimization is compared. The results indicate that hyper-heuristic algorithms outperform heuristic algorithms in terms of solution quality and stability, effectively satisfying the storage requirements of the yard while minimizing the carbon emissions and the number of container rehandling operations. The results provide theoretical support for port enterprises in improving their operational efficiency and achieving their goals regarding low carbon emissions.

Advanced concrete technology is the science of efficient, cost‐effective, and safe design in civil engineering projects. Engineers and concrete designers are generally faced with the slightest change in the conditions or objectives of the project, which makes it challenging to choose the optimal design among several ones. Besides, the experimental examination of all of them requires time and high costs. Hence, an efficient approach is to utilize artificial intelligence (AI) techniques to predict and optimize real‐world problems in concrete technology. Despite the large body of publications in this field, there are few comprehensive surveys that conduct scientometric analysis. This paper provides a state‐of‐the‐art review that lists, summarizes, and categorizes the most widely used machine learning methods, meta‐heuristic algorithms, and hybrid approaches to concrete issues. To this end, 457 publications are considered during the recent decade with a scientometric approach to highlight the annual trend/active journals/top researchers/co‐occurrence of key title words/countries' participation/research hotspots. In addition, AI techniques are classified into distinct clusters using VOSviewer clustering visualization to identify the application scope and their relationship through the link strength. The findings can be a beacon to help researchers utilize AI techniques in future research on advanced concrete technology.

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.

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.

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.