A novel metaheuristic optimization algorithm, namely the Farthest better or Nearest worse Optimizer (FNO) algorithm, is proposed in this paper. The idea behind the FNO algorithm is derived from the qualities and distances between agents’ positions in a search space. The process of searching in the FNO includes two phases. During the first phase of the FNO, it jumps over the nearest regions with lower potential to avoid local optima. In the second phase, the algorithm tries to explore the farthest positions with higher potential to reach or explore the global optimum. These operations aim to enhance population diversity and provide the FNO with opportunities to discover high-quality regions while avoiding low-quality regions. A structural component within FNO, called Dynamic Focus Strategy (DFS), is also presented for controlling the exploration ratio. The DFS applies a random vector as a coefficient to shrink the area around the farthest better positions throughout the search process. Several experimental studies have been conducted on well-known benchmark suites, comprising 45 benchmarks, to assess the efficacy of the FNO algorithm. Additionally, five engineering problems were used to evaluate the practical applicability of the proposed FNO algorithm. The Wilcoxon test, as a well-known non-parametric statistical test, is conducted to fairly compare results. The findings indicate that the FNO algorithm performs competitively against other state-of-the-art population-based metaheuristic algorithms on the tested problems.
Shear wave velocity (VS) is one of the most important parameters in deep and surface studies and the estimation of geotechnical design parameters. This parameter is widely utilized to determine permeability and porosity, lithology, rock mechanical parameters, and fracture assessment. However, measuring this important parameter is either impossible or difficult due to the challenges related to horizontal and deviation wells or the difficulty in reaching cores. Artificial Intelligence (AI) techniques, especially Machine Learning (ML), have emerged as efficient approaches for dealing with such challenges. Therefore, considering the advantage of the ML, the current research proposes a novel Fully-Self-Adaptive Harmony Search—Group Method of Data Handling (GMDH)-type neural network, named FSHS-GMDH, to estimate the VS parameter. In this way, the Harmony Memory Consideration Rate (HMCR) and Pitch Adjustment Rate (PAR) parameters are calculated automatically. A novel method is also introduced to adjust the value of the Bandwidth (BW) parameter based on the cosine wave and each decision variable values. In addition, a variable-size harmony memory is proposed to enhance both the diversification and intensification. Our proposed FSHS-GMDH algorithm quickly explores the problem space and exploits the best regions at the late iterations. This algorithm allows for the training of the prediction model based on the P-wave velocity (VP) and the bulk density of rock (RHOB). Applying the proposed algorithm to a carbonate petroleum reservoir in the Persian Gulf demonstrates that it is capable of accurately estimating the VS parameter better than state-of-the-art machine learning methods in terms of the coefficient of determination (R2), Mean Square Error (MSE), and Root Mean Square Error (RMSE).
1 October 2015 in Journal of Network and Computer Applications
Hybrid Wireless Network-on-Chip (HWNoC) architecture has been introduced as a promising communication infrastructure for multicore systems. HWNoC-based multicore systems encounter extremely dynamic application workloads that are submitted at run-time. Mapping and scheduling of these applications are critical for system performance, especially for real-time applications. The existing resource allocation approaches either ignore the use of wireless links in task allocation on cores or ignore the timing characteristic of tasks. In this paper, we propose a new deadline-aware and energy-efficient dynamic task mapping and scheduling approach for the HWNoC-based multicore system. By using of core utilization threshold and tasks laxity time, the proposed approach aims to minimize communication energy consumption and satisfy the deadline of the real-time applications tasks. Through cycle-accurate simulation, the performance of the proposed approach has been compared with state-of-the-art approaches in terms of communication energy consumption, deadline violation rate, communication latency, and runtime overhead. The experimental results confirmed that the proposed approach is a very competitive approach among the alternative approaches.
16 September 2013 in Security and Communication Networks