Search results

Community detection of dynamic networks provides more effective information than static network community detection in the real world. The mainstream method for community detection in dynamic networks is evolutionary clustering, which uses temporal smoothness of community structures to connect snapshots of networks in adjacent time intervals. However, the error accumulation issues limit the effectiveness of evolutionary clustering. While the multi-objective evolutionary approach can solve the issue of fixed settings of the two objective function weight parameters in the evolutionary clustering framework, the traditional multi-objective evolutionary approach lacks self-adaptability.

This paper proposes a community detection algorithm that integrates evolutionary clustering and decomposition-based multi-objective optimization methods. In this approach, a benchmark correction procedure is added to the evolutionary clustering framework to prevent the division results from drifting.

Experimental results demonstrate the superior accuracy of this method compared to similar algorithms in both real and synthetic dynamic datasets.

To enhance the clustering results, adaptive variances and crossover probabilities are designed based on the relative change amounts of the subproblems decomposed by MOEA/D (A Multiobjective Optimization Evolutionary Algorithm based on Decomposition) to dynamically adjust the focus of different evolutionary stages.

This study aims to solve the problem of job scheduling and multi automated guided vehicle (AGV) cooperation in intelligent manufacturing workshops.

In this study, an algorithm for job scheduling and cooperative work of multiple AGVs is designed. In the first part, with the goal of minimizing the total processing time and the total power consumption, the niche multi-objective evolutionary algorithm is used to determine the processing task arrangement on different machines. In the second part, AGV is called to transport workpieces, and an improved ant colony algorithm is used to generate the initial path of AGV. In the third part, to avoid path conflicts between running AGVs, the authors propose a simple priority-based waiting strategy to avoid collisions.

The experiment shows that the solution can effectively deal with job scheduling and multiple AGV operation problems in the workshop.

In this paper, a collaborative work algorithm is proposed, which combines the job scheduling and AGV running problem to make the research results adapt to the real job environment in the workshop.

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

Nature’s evolution has shaped intelligent behaviors in creatures like insects and birds, inspiring the field of Swarm Intelligence. Researchers have developed bio-inspired algorithms to address complex optimization problems efficiently. These algorithms strike a balance between computational efficiency and solution optimality, attracting significant attention across domains.

Bio-inspired optimization techniques for feature engineering and its applications are systematically reviewed with chief objective of assessing statistical influence and significance of “Bio-inspired optimization”-based computational models by referring to vast research literature published between year 2015 and 2022.

The Scopus and Web of Science databases were explored for review with focus on parameters such as country-wise publications, keyword occurrences and citations per year. Springer and IEEE emerge as the most creative publishers, with indicative prominent and superior journals, namely, PLoS ONE, Neural Computing and Applications, Lecture Notes in Computer Science and IEEE Transactions. The “National Natural Science Foundation” of China and the “Ministry of Electronics and Information Technology” of India lead in funding projects in this area. China, India and Germany stand out as leaders in publications related to bio-inspired algorithms for feature engineering research.

The review findings integrate various bio-inspired algorithm selection techniques over a diverse spectrum of optimization techniques. Anti colony optimization contributes to decentralized and cooperative search strategies, bee colony optimization (BCO) improves collaborative decision-making, particle swarm optimization leads to exploration-exploitation balance and bio-inspired algorithms offer a range of nature-inspired heuristics.

The compressive strength of concrete depends on many interdependent parameters; its exact prediction is not that simple because of complex processes involved in strength development. This study aims to predict the compressive strength of normal concrete and high-performance concrete using four datasets.

In this paper, five established individual Machine Learning (ML) regression models have been compared: Decision Regression Tree, Random Forest Regression, Lasso Regression, Ridge Regression and Multiple-Linear regression. Four datasets were studied, two of which are previous research datasets, and two datasets are from the sophisticated lab using five established individual ML regression models.

The five statistical indicators like coefficient of determination (R²), mean absolute error, root mean squared error, Nash–Sutcliffe efficiency and mean absolute percentage error have been used to compare the performance of the models. The models are further compared using statistical indicators with previous studies. Lastly, to understand the variable effect of the predictor, the sensitivity and parametric analysis were carried out to find the performance of the variable.

The findings of this paper will allow readers to understand the factors involved in identifying the machine learning models and concrete datasets. In so doing, we hope that this research advances the toolset needed to predict compressive strength.

With the rapid development of Internet technology, cybersecurity threats such as security loopholes, data leaks, network fraud, and ransomware have become increasingly prominent, and organized and purposeful cyberattacks have increased, posing more challenges to cybersecurity protection. Therefore, reliable network risk assessment methods and effective network security protection schemes are urgently needed.

Based on the dynamic behavior patterns of attackers and defenders, a Bayesian network attack graph is constructed, and a multitarget risk dynamic assessment model is proposed based on network availability, network utilization impact and vulnerability attack possibility. Then, the self-organizing multiobjective evolutionary algorithm based on grey wolf optimization is proposed. And the authors use this algorithm to solve the multiobjective risk assessment model, and a variety of different attack strategies are obtained.

The experimental results demonstrate that the method yields 29 distinct attack strategies, and then attacker's preferences can be obtained according to these attack strategies. Furthermore, the method efficiently addresses the security assessment problem involving multiple decision variables, thereby providing constructive guidance for the construction of security network, security reinforcement and active defense.

A method for network risk assessment methods is given. And this study proposed a multiobjective risk dynamic assessment model based on network availability, network utilization impact and the possibility of vulnerability attacks. The example demonstrates the effectiveness of the method in addressing network security risks.

Although extensive research has been conducted on precast production, irregular component loading constraints have received little attention, resulting in limitations for transportation cost optimization. Traditional irregular component loading methods are based on past performance, which frequently wastes vehicle space. Additionally, real-time road conditions, precast component assembly times, and delivery vehicle waiting times due to equipment constraints at the construction site affect transportation time and overall transportation costs. Therefore, this paper aims to provide an optimization model for Just-In-Time (JIT) delivery of precast components considering 3D loading constraints, real-time road conditions and assembly time.

In order to propose a JIT (just-in-time) delivery optimization model, the effects of the sizes of irregular precast components, the assembly time, and the loading methods are considered in the 3D loading constraint model. In addition, for JIT delivery, incorporating real-time road conditions in the transportation process is essential to mitigate delays in the delivery of precast components. The 3D precast component loading problem is solved by using a hybrid genetic algorithm which mixes the genetic algorithm and the simulated annealing algorithm.

A real case study was used to validate the JIT delivery optimization model. The results indicated this study contributes to the optimization of strategies for loading irregular precast components and the reduction of transportation costs by 5.38%.

This study establishes a JIT delivery optimization model with the aim of reducing transportation costs by considering 3D loading constraints, real-time road conditions and assembly time. The irregular precast component is simplified into 3D bounding box and loaded with three-space division heuristic packing algorithm. In addition, the hybrid algorithm mixing the genetic algorithm and the simulated annealing algorithm is to solve the 3D container loading problem, which provides both global search capability and the ability to perform local searching. The JIT delivery optimization model can provide decision-makers with a more comprehensive and economical strategy for loading and transporting irregular precast components.

To generate electricity, solar photovoltaic (PV) systems are among the best, most eco-friendly and most cost-effective solutions available. Extraction of maximum possible electricity from the solar PV system is complicated by a number of factors brought on by the ever-changing weather conditions under which it must operate. Many conventional and evolutionary algorithm-based maximum power point tracking (MPPT) techniques have the limitation of not being able to extract maximum power under partial shade and rapidly varying irradiance. Hence, the purpose of this paper is to propose a novel hybrid slime mould assisted with perturb and observe (P&O) global MPPT technique (HSMO) for the hybrid bridge link-honey comb (BL-HC) configured PV system to enhance the better maximum power during dynamic and steady state operations within less time.

In this method, a hybridization of two algorithms is proposed to track the true with faster convergence under PSCs. Initially, the slime mould optimization (SMO) algorithm is initiated for exploration of optimum duty cycles and later P&O algorithm is initiated for exploitation of global duty cycle for the DC–DC converter to operate at GMPP and for fast convergence.

The effectiveness of the proposed HSMO MPPT is compared with adaptive coefficient particle swarm optimization (ACPSO), flower pollination algorithm and SMO MPPT techniques in terms of tracked GMPP, convergence time/tracking speed and efficacy under six complex partial shading conditions. From the results, it is noticed that the proposed algorithm tracks the true GMPP under most of the shading conditions with less tracking time when compared to other MPPT techniques.

This paper proposes a novel hybrid slime mould assisted with perturb and observe (P&O) global MPPT technique (HSMO) for the hybrid BL-HC configured PV system enhance the better maximum power under partial shading conditions (PSCs). This method operated in two stages as SMO for exploration and P&O for exploitation for faster convergence and to track true GMPP under PSCs. The proposed approach largely improves the performance of the MPP tracking of the PV systems. Initially, the proposed MPPT technique is simulated in MATLAB/Simulink environment. Furthermore, an experimental setup has been designed and implemented. Simulation results obtained are validated through experimental results which prove the viability of the proposed technique for an efficient green energy solution.

The first purpose is to assess the quality of containerized multimodal export and the second is to develop and demonstrate the design of a service network with quality approach.

The article used the structural equation model to develop a model to measure the quality of multimodal transportation for containerized exports and finalized the model with an alternative approach. The evolutionary algorithm had been used to design a service network based on quality.

Provided factors affecting quality of multimodal transportation and reverse to one hypothesis, the construct variation in cost, time shape and quantity did not affect the quality of multimodal transportation for containerized exports. The model without variation construct was finalized by exploring causality.

This research had scope till container loading onto the vessel and assessed the quality for containerized cargo only, and second research purpose is limited by assumed values of fitness function and the limited number of nodes, in service network design demonstration.

This research provided a tool to measure the quality of multimodal transportation for containerized exports and demonstrated the field application of the model developed in service network design. This approach included all factors applicable across the container movement. The integrated approach of the article provided an organized method to design a service network for containerized exports.

This work provided the tool to assess the quality of multimodal transportation for containerized exports and developed an approach to design a service network of multimodal transportation based on quality. This approach has considered the factors of multimodal transportation comprehensively in contrast to the optimization approaches based on operation research techniques.

There are few reports that evolutional topology optimization methods are applied to the conductor geometry design problems. This paper aims to propose an evolutional topology optimization method is applied to the conductor design problems of an on-chip inductor model.

This paper presents a topology optimization method for conductor shape designs. This method is based on the normalized Gaussian network-based evolutional on/off topology optimization method and the covariance matrix adaptation evolution strategy. As a target device, an on-chip planer inductor is used, and single- and multi-objective optimization problems are defined. These optimization problems are solved by the proposed method.

Through the single- and multi-objective optimizations of the on-chip inductor, it is shown that the conductor shapes of the inductor can be optimized based on the proposed methods.

The proposed topology optimization method is applicable to the conductor design problems in that the connectivity of the shapes is strongly required.