Peng Yang

Bio: Peng Yang is an academic researcher from Hebei University of Technology. The author has contributed to research in topics: Evolutionary algorithm & Software deployment. The author has an hindex of 4, co-authored 6 publications receiving 211 citations.

Multiobjective Evolution of Fuzzy Rough Neural Network via Distributed Parallelism for Stock Prediction

Abstract: Fuzzy rough theory can describe real-world situations in a mathematically effective and interpretable way, while evolutionary neural networks can be utilized to solve complex problems. Combining them with these complementary capabilities may lead to evolutionary fuzzy rough neural network with the interpretability and prediction capability. In this article, we propose modifications to the existing models of fuzzy rough neural network and then develop a powerful evolutionary framework for fuzzy rough neural networks by inheriting the merits of both the aforementioned systems. We first introduce rough neurons and enhance the consequence nodes, and further integrate the interval type-2 fuzzy set into the existing fuzzy rough neural network model. Thus, several modified fuzzy rough neural network models are proposed. While simultaneously considering the objectives of prediction precision and network simplicity , each model is transformed into a multiobjective optimization problem by encoding the structure, membership functions, and the parameters of the network. To solve these optimization problems, distributed parallel multiobjective evolutionary algorithms are proposed. We enhance the optimization processes with several measures including optimizer replacement and parameter adaption. In the distributed parallel environment, the tedious and time-consuming neural network optimization can be alleviated by numerous computational resources, significantly reducing the computational time. Through experimental verification on complex stock time series prediction tasks, the proposed optimization algorithms and the modified fuzzy rough neural network models exhibit significant improvements the existing fuzzy rough neural network and the long short-term memory network.

Security-Aware Industrial Wireless Sensor Network Deployment Optimization

Abstract: Security is crucial for industrial wireless sensor networks (IWSNs); therefore, in this article, we simultaneously consider the security, lifetime, and coverage issues by deploying sensor nodes and relay nodes in an industrial environment to analyze the multipath routing for enhancing security. For the security issue, the computation of disjoint routing paths is converted to a maximum flow problem. Then, the deployment problem is transformed into a multiobjective optimization problem, which we address by employing six state-of-the-art serial algorithms and two distributed parallel algorithms. Additionally, based on our prior work, by testing random grouping and prior knowledge-based grouping, as well as another optimizer, we propose enhanced distributed parallel algorithms. As verified by experiments, the proposed algorithms outperform their counterparts. Due to the characteristic of distributed parallelism, the time consumed by the proposed algorithms is significantly reduced compared to that of the serial algorithms. Therefore, the proposed algorithms can achieve better performance within a very limited time.

Large-Scale Many-Objective Deployment Optimization of Edge Servers

Abstract: The development of the Internet of Vehicles (IoV) has made transportation systems into intelligent networks. However, with the increase in vehicles, an increasing number of data need to be analyzed and processed. Roadside units (RSUs) can offload the data collected from vehicles to remote cloud servers for processing, but they cause significant network latency and are unfriendly to applications that require real-time information. Edge computing (EC) brings low service latency to users. There are many studies on computing offloading strategies for vehicles or other mobile devices to edge servers (ESs), and the deployment of ESs cannot be ignored. In this paper, the placement problem of ESs in the IoV is studied, and the six-objective ES deployment optimization model is constructed by simultaneously considering transmission delay, workload balancing, energy consumption, deployment costs, network reliability, and ES quantity. In addition, the deployment problem of ESs is optimized by a many-objective evolutionary algorithm. By comparing with the state-of-the-art methods, the effectiveness of the algorithm and model is verified.

Diversified Personalized Recommendation Optimization Based on Mobile Data

Abstract: With the advent of the Internet of Things, especially the Internet of Vehicles, abundant environmental and mobile data can be generated continuously. A personalized recommender system is one of the important methods for solving the problem of big data overload. However, to make use of these mobile data from vehicles, traditional recommender services are confronted by severe challenges. Therefore, we study the diversified recommendation problem based on a real-world dataset, represented as a tensor with three dimensions of user, location and activity. As the tensor is rather sparse, we employ tensor decomposition to predict missing values. Additionally, we directly regard recommendation precision as an objective. In addition to precision, we also consider the recommendation novelty and coverage, providing a more comprehensive view of the recommender system. Thus, visitors can discover attractive spots that are less visited in a personalized manner, relieving traffic pressure at famous scenic spots and balancing overall transportation. By integrating all these objectives, we construct a many-objective recommendation model. To optimize this model, we propose a distributed parallel evolutionary algorithm employing the nondominated ranking and crowding distance. Compared with the state-of-the-art algorithms, the proposed algorithm performs well and is very efficient.

3-D Deployment Optimization for Heterogeneous Wireless Directional Sensor Networks on Smart City

Abstract: The development of smart cities and the emergence of three-dimensional (3-D) urban terrain data have introduced new requirements and issues to the research on the 3-D deployment of wireless sensor networks. We study the deployment issue of heterogeneous wireless directional sensor networks in 3-D smart cities. Traditionally, studies on the deployment problem of WSNs focus on omnidirectional sensors on a 2-D plane or in full 3-D space. Based on 3-D urban terrain data, we transform the deployment problem into a multiobjective optimization problem, in which objectives of Coverage , Connectivity Quality , and Lifetime , as well as the Connectivity and Reliability constraints, are simultaneously considered. A graph-based 3-D signal propagation model employing the line-of-sight concept is used to calculate the signal path loss. Novel distributed parallel multiobjective evolutionary algorithms (MOEAs) are also proposed. For verification, real-world and artificial urban terrains are utilized. In comparison with other state-of-the-art MOEAs, the novel algorithms could more effectively and more efficiently address the deployment problem in terms of optimization performance and operation time.

Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts

Abstract: A recent set of overused population-based methods have been published in recent years. Despite their popularity, most of them have uncertain, immature performance, partially done verifications, similar overused metaphors, similar immature exploration and exploitation components and operations, and an insecure tradeoff between exploration and exploitation trends in most of the new real-world cases. Therefore, all users need to extensively modify and adjust their operations based on main evolutionary methods to reach faster convergence, more stable balance, and high-quality results. To move the optimization community one step ahead toward more focus on performance rather than change of metaphor, a general-purpose population-based optimization technique called Hunger Games Search (HGS) is proposed in this research with a simple structure, special stability features and very competitive performance to realize the solutions of both constrained and unconstrained problems more effectively. The proposed HGS is designed according to the hunger-driven activities and behavioural choice of animals. This dynamic, fitness-wise search method follows a simple concept of “Hunger” as the most crucial homeostatic motivation and reason for behaviours, decisions, and actions in the life of all animals to make the process of optimization more understandable and consistent for new users and decision-makers. The Hunger Games Search incorporates the concept of hunger into the feature process; in other words, an adaptive weight based on the concept of hunger is designed and employed to simulate the effect of hunger on each search step. It follows the computationally logical rules (games) utilized by almost all animals and these rival activities and games are often adaptive evolutionary by securing higher chances of survival and food acquisition. This method's main feature is its dynamic nature, simple structure, and high performance in terms of convergence and acceptable quality of solutions, proving to be more efficient than the current optimization methods. The effectiveness of HGS was verified by comparing HGS with a comprehensive set of popular and advanced algorithms on 23 well-known optimization functions and the IEEE CEC 2014 benchmark test suite. Also, the HGS was applied to several engineering problems to demonstrate its applicability. The results validate the effectiveness of the proposed optimizer compared to popular essential optimizers, several advanced variants of the existing methods, and several CEC winners and powerful differential evolution (DE)-based methods abbreviated as LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPEDE, and JDE methods in handling many single-objective problems. We designed this open-source population-based method to be a standard tool for optimization in different areas of artificial intelligence and machine learning with several new exploratory and exploitative features, high performance, and high optimization capacity. The method is very flexible and scalable to be extended to fit more form of optimization cases in both structural aspects and application sides. This paper's source codes, supplementary files, Latex and office source files, sources of plots, a brief version and pseudocode, and an open-source software toolkit for solving optimization problems with Hunger Games Search and online web service for any question, feedback, suggestion, and idea on HGS algorithm will be available to the public at https://aliasgharheidari.com/HGS.html .

RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method

Abstract: The optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliche methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliche methods suffer from the locally efficient performance, biased verification methods on easy problems, and high similarity between their components' interactions. This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization method based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics. The proposed RUNge Kutta optimizer (RUN) was developed to deal with various types of optimization problems in the future. The RUN utilizes the logic of slope variations computed by the RK method as a promising and logical searching mechanism for global optimization. This search mechanism benefits from two active exploration and exploitation phases for exploring the promising regions in the feature space and constructive movement toward the global best solution. Furthermore, an enhanced solution quality (ESQ) mechanism is employed to avoid the local optimal solutions and increase convergence speed. The RUN algorithm's efficiency was evaluated by comparing with other metaheuristic algorithms in 50 mathematical test functions and four real-world engineering problems. The RUN provided very promising and competitive results, showing superior exploration and exploitation tendencies, fast convergence rate, and local optima avoidance. In optimizing the constrained engineering problems, the metaphor-free RUN demonstrated its suitable performance as well. The authors invite the community for extensive evaluations of this deep-rooted optimizer as a promising tool for real-world optimization. The source codes, supplementary materials, and guidance for the developed method will be publicly available at different hubs at http://imanahmadianfar.com and http://aliasgharheidari.com/RUN.html .

Orthogonal learning covariance matrix for defects of grey wolf optimizer: Insights, balance, diversity, and feature selection

Abstract: This research’s genesis is in two aspects: first, a guaranteed solution for mitigating the grey wolf optimizer’s (GWO) defect and deficiencies. Second, we provide new open-minding insights and deep views about metaheuristic algorithms. The population-based GWO has been recognized as a popular option for realizing optimal solutions. Despite the popularity, the GWO has structural defects and uncertain performance and has certain limitations when dealing with complex problems such as multimodality and hybrid functions. This paper tries to overhaul the shortcomings of the original process and develops a GWO variant enhanced with a covariance matrix adaptation evolution strategy (CMAES), levy flight mechanism, and orthogonal learning (OL) strategy named GWOCMALOL. The algorithm uses the levy flight mechanism, orthogonal learning strategy, and CMAES to bring more effective exploratory inclinations. We conduct numerical experiments based on various functions in IEEE CEC2014. It is also compared with 10 other algorithms with competitive performances, 7 improved GWO variants, and 11 advanced algorithms. Moreover, for more systematic data analysis, Wilcoxon signed-rank test is used to evaluate the results further. Experimental results show that the GWOCMALOL algorithm is superior to other algorithms in terms of convergence speed and accuracy. The proposed GWO-based version is discretized into a binary tool through the transformation function. We evaluate the performance of the new feature selection method based on 24 UCI data sets.​ Experimental results show that the developed algorithm performs better than the original technique, and the defects are resolved. Besides, we could reach higher classification accuracy and fewer feature selections than other optimization algorithms. A narrative web service at http://aliasgharheidari.com will offer the required data and material about this work.