scispace - formally typeset
Search or ask a question
Author

Bin Cao

Other affiliations: Chinese Ministry of Education
Bio: Bin Cao is an academic researcher from Hebei University of Technology. The author has contributed to research in topics: Evolutionary algorithm & Optimization problem. The author has an hindex of 14, co-authored 29 publications receiving 841 citations. Previous affiliations of Bin Cao include Chinese Ministry of Education.

Papers
More filters
Journal ArticleDOI
TL;DR: An improved algorithm based on Two_Arch2 is proposed to improve the scalability and decentralization while reducing the latency and cost of the blockchain.
Abstract: The Industrial Internet of Things (IIoT) has developed rapidly in recent years. Private blockchains with decentralization, flexible rules, and good privacy protection can be applied in the IIoT to process the massive data and tackle the security problem. However, the scalability of blockchain places a restriction on IIoT. Accordingly, this article proposes an improved algorithm based on Two_Arch2 to improve the scalability and decentralization while reducing the latency and cost of the blockchain. By integrating the private blockchain theory to IIoT and simultaneously considering the above four objectives, a many-objective blockchain-enabled IIoT model is constructed. Then an improved Two_Arch2 algorithm is utilized to solve the model. Experimental results show that the improved algorithm can effectively optimize four indicators of the model.

133 citations

Journal ArticleDOI
TL;DR: Modifications to the existing models of fuzzy rough neural network are proposed and a powerful evolutionary framework for fuzzyrough neural networks is developed by inheriting the merits of both the merits and the objectives of prediction precision and network simplicity are considered.
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.

127 citations

Journal ArticleDOI
TL;DR: An improved two-archive many-objective evolutionary algorithm (TA-MaEA) based on fuzzy decision to solve the sizing optimization problem for HMSs and can reduce the system costs by 7%, 13%, and 21%, respectively.
Abstract: The economics, reliability, and carbon efficiency of hybrid microgrid systems (HMSs) are often in conflict; hence, a reasonable design for the sizing of the initial microgrid is important. In this article, we propose an improved two-archive many-objective evolutionary algorithm (TA-MaEA) based on fuzzy decision to solve the sizing optimization problem for HMSs. For the HMS simulated in this article, costs, loss of power supply probability, pollutant emissions, and power balance are considered as objective functions. For the proposed algorithm, we employ two archives with different diversity selection strategies to balance convergence and diversity in the high-dimensional objective space. In addition, a fuzzy decision making method is proposed to further help decision makers obtain a solution from the Pareto front that optimally balances the objectives. The effectiveness of the proposed algorithm in solving the HMS sizing optimization problem is investigated for the case of Yanbu, Saudi Arabia. The experimental results show that, compared with the two-archive evolutionary algorithm for constrained many-objective optimization (C-TAEA), the clustering-based adaptive many-objective evolutionary algorithm (CA-MOEA), and the improved decomposition-based evolutionary algorithm (I-DBEA), the proposed algorithm can reduce the system costs by 7%, 13%, and 21%, respectively.

125 citations

Journal ArticleDOI
TL;DR: A novel 5G IoV architecture is designed on the basis of fog-cloud computing and software-defined networking (SDN), and a many-objective optimization algorithm is proposed that outperforms the other state-of-the-art algorithms.
Abstract: In the traditional cloud-based Internet of Vehicles (IoV) architecture, it is difficult to guarantee the low latency requirements of the current intelligent transportation system (ITS). As a supplement to cloud computing, fog computing can effectively alleviate the bottlenecks of cloud computing bandwidth and computing resources and improve the quality of service (QoS) of the IoV. However, as a distributed system that operates near users, fog computing has a complicated network structure. In the complex and dynamic IoV environment, to effectively manage these computing resources with different attributes and provide high-quality services, it is necessary to design an efficient architecture and a resource allocation algorithm. Therefore, on the basis of fog-cloud computing and software-defined networking (SDN), a novel 5G IoV architecture is designed. In addition, after fully considering the service requirements of the IoV, a model of four objectives is constructed, and a many-objective optimization algorithm is proposed. The experiment results show that the proposed algorithm outperforms the other state-of-the-art algorithms.

117 citations

Journal ArticleDOI
TL;DR: This paper proposes multiobjective graph-based differential grouping with shift (mogDG-shift) to decompose the large number of variables in an MOLSOP, and combines the algorithms together with the original algorithms to show improved optimization performance.
Abstract: An increasing number of multiobjective large-scale optimization problems (MOLSOPs) are emerging. Optimization based on variable grouping and cooperative coevolution is a good way to address MOLSOPs, but few attempts have been made to decompose the variables in MOLSOPs. In this paper, we propose multiobjective graph-based differential grouping with shift (mogDG-shift) to decompose the large number of variables in an MOLSOP. We analyze the variable properties, then detect the interactions among variables, and finally group the variables based on their properties and interactions. We modify the decision variable analyses (DVA) in the multiobjective evolutionary algorithm based on decision variable analyses (MOEA/DVA), extend graph-based differential grouping (gDG) to MOLSOPs, and test the method on many MOLSOPs. The experimental results show that mogDG-shift can achieve 100% grouping accuracy for LSMOP and DTLZ as well as almost all WFG instances, which are much better than DVA. We further combine mogDG-shift with two representative multiobjective evolutionary algorithms: the multiobjective evolutionary algorithm based on decomposition (MOEA/D) and the non-dominated sorting genetic algorithm II (NSGA-II). Compared with the original algorithms, the algorithms combined with mogDG-shift show improved optimization performance.

111 citations


Cited by
More filters
01 Jun 2005

3,154 citations

01 Jan 2016
TL;DR: Thank you very much for downloading using mpi portable parallel programming with the message passing interface for reading a good book with a cup of coffee in the afternoon, instead they are facing with some malicious bugs inside their laptop.
Abstract: Thank you very much for downloading using mpi portable parallel programming with the message passing interface. As you may know, people have search hundreds times for their chosen novels like this using mpi portable parallel programming with the message passing interface, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they are facing with some malicious bugs inside their laptop.

593 citations

Journal ArticleDOI
TL;DR: This open-source population-based optimization technique called Hunger Games Search is designed 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.
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 .

529 citations

Journal ArticleDOI
TL;DR: This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics.
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 .

429 citations

Journal ArticleDOI
TL;DR: The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques.
Abstract: In recent years, the research community has witnessed an explosion of literature dealing with the mimicking of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques.

401 citations