With the continuous development of industrial manufacturing, rationally scheduling multiple-source flexible orders is crucial for achieving sustainable production. However, most existing methods adopt a single-task optimization paradigm with independent modeling, overlooking the similarities among multi-source orders and the correlations between scheduling optimizations. This leads to additional waste of computational resources and the loss of prior experience. To address this issue, we propose a many-objective multi-task optimization paradigm that takes into account the correlations among multi-source flexible orders. Specifically, through the multi-task optimization paradigm, multiple flexible orders with different variable dimensions are uniformly modeled by sharing a set of objective functions, thereby enabling the joint optimization of related scheduling tasks. Secondly, to investigate the impact of tool wear on scheduling performance, an exponential function-based tool wear coefficient is introduced, and a many-objective optimization model is constructed that considers indicators such as processing time, energy consumption, load balancing, and tool wear amount. Next, considering the discrete problem properties, a many-objective multi-task evolutionary algorithm based on load balancing (MTMOEA-LB) is designed to avoid premature convergence of the multi-task optimization algorithm due to task differences. Finally, the actual production order data set of a flange enterprise is used for experimental comparison. Experimental results indicate that the proposed algorithm can output high-quality scheduling schemes quickly and effectively compared with other advanced optimization algorithms.

In the field of multi-objective multi-task optimization, knowledge transfer is crucial to improve the performance of algorithms. However, most existing studies directly transfer individuals, which is prone to introduce irrelevant genes and cause negative transfer phenomena. For this reason, this paper proposes a multi-objective multitasking algorithm based on dimensional importance assessment and knowledge transfer. First, the algorithm designs indicators to assess the importance of dimensions. It screens out the key dimensions of the source and target tasks by analyzing the difference between the decision vectors of the optimal and the worst solutions in the population, combined with the out-of-bag error calculation method of random forest. Then, dimension matching is performed using Euclidean distance to ensure the correspondence of key dimensions of source and target tasks. Subsequently, non-dominated solutions are selected from the source task to transfer to the target task and verify the performance. For the successfully transferred solutions, the scaling relationship of the key dimensions is calculated, and they are transferred to the target task for adjustment according to the dimension-matching relationship. Experiments show that this method can effectively improve the knowledge transfer effect and reduce negative transfer.

ABSTRACT Workflow tasks in the cloud environment are the abstraction and decomposition of large‐scale and complex tasks in real‐world scenarios, so cloud workflow scheduling problems have important research significance. However, most of the existing cloud workflow scheduling schemes are aimed at a single workflow, and do not make reasonable use of the commonality or complementary knowledge between similar tasks. Moreover, most cloud workflow scheduling models mainly focus on a few objectives such as time or cost, which is not comprehensive enough. Therefore, this paper first proposes a multi‐objective cloud workflow scheduling model, which solves the maximum completion time, execution cost and energy consumption as three objectives during task execution. Secondly, to efficiently handle multiple similar cloud workflow scheduling tasks at the same time, this paper treats various cloud workflow scheduling issues as distinct tasks, establishes a multi‐task cloud workflow scheduling framework that aims for the same goal while accommodating workflows of differing scales, and a multi‐objective evolutionary multi‐task optimization algorithm based on elite selection (MOEMT‐ES) is designed to solve the above scheduling model. Finally, through algorithm comparison experiments on the CEC2017 evolutionary multi‐task optimization competition benchmark problem and multi‐workflow test problem, MOEMT‐ES shows superior competitiveness.

The integration of renewable energy sources (RES) into new power system (NPS) represents a crucial approach for reducing carbon emissions (CEs) and mitigating resource consumption in cloud computing centers. However, the inherent uncertainties of RES generation, such as randomness, volatility, and intermittency, pose significant challenges to the scheduling of NPS. A data-driven multi-energy complementary uncertainty scheduling method is proposed to address these issues and ensure a stable power supply from NPS to cloud computing centers. First, we constructed a stochastic differential equation (SDE) to represent the uncertainty characteristics of renewable energy generation, and proposed a SDE deep network based on LSTM (LSTM-SDE Net) to capture and learn the aleatoric uncertainty and epistemic uncertainty of units; subsequently, we established the multi-energy complementary uncertain many-objective scheduling model (MuC-UMaOSM) by utilizing the interval parametric estimation, which aims to optimize grid total cost (TC), RES consumption rate (CR), CEs, grid economic benefits (EB) and load balancing (LB); finally, in order to obtain trade-off solutions with improved convergence, diversity, and uncertainty, we designed a two-population cooperative interval many-objective evolutionary algorithm (T-PIMaOEA) to solve the proposed model. Experimental results demonstrate the excellent performance of our method in the multi-energy complementary scheduling (MECS).

The concept of mobile crowd sensing (MCS) represents a powerful model within the Internet of Things. It perceives different phenomena in the urban environment by taking advantage of the mobility of individuals and the sensors embedded in smartphones. Existing MCS task allocation systems typically assume that workers are in an idle state without any current tasks. However, this overlooks workers who are already engaged in other tasks but are closer to the task location, leading to potential resource wastage. In this article, we refer to such workers as “the latent workers.” To address this issue, we propose a novel model called the constrained many-objective MCS task allocation model considering latent workers (CMaO-MCSTA-LW). This model aims to find a set of compromise solutions under multiple uncontrollable objective environments. To effectively solve this model, we developed a new algorithm called the dual-population constrained many-objective evolutionary algorithm based on the easing strategy and the elite parent strategy (dCMaOEA-E-P), which builds upon the original dCMaOEA-RAE. Experimental results demonstrate that, compared to several other representative algorithms, the proposed algorithm shows superior performance across multiple perspectives, significantly improving task allocation efficiency.

Summary Matrix factorization (MF)‐based recommender systems (RSs) as black‐box models fail to provide explanations for the recommended items. While some models attain a degree of explainability by integrating neighborhood algorithms, which compute explainability based on the preferences of proximate users, they overlook the contribution of the subjective preferences of the target user to enhancing model explainability, resulting in suboptimal model explainability. To address this problem, an explainable RS directed by reconstructed explanatory factors and multi‐modal matrix factorization (ERS‐REFMMF) is proposed. By integrating users' subjective sentiment and preference features into the rating matrix to form a multi‐modal matrix, ERS‐REFMMF utilizes the Funk‐singular value decomposition method at the foundational layer to decompose the multi‐modal matrix and generate a candidate item set. At the upper layer, explainability is constructed based on the target user's subjective preferences and latent features derived from MF, and the final recommended list is optimized for accuracy, diversity, novelty, and explainability through multi‐objective optimization algorithms. ERS‐REFMMF models around users' explicit preferences and latent associations, reconstructs explainability with hybrid factors, and enhances overall performance through a many‐objective optimization algorithm. Experimental results on real datasets demonstrate that the proposed model is competitive in both phases compared to existing recommendation methods.

Summary Given the escalating magnitude and intricacy of software systems, software measurement data often contains irrelevant and redundant features, resulting in significant resource and storage requirements for software defect prediction (SDP). Feature selection (FS) has a vital impact on the initial data preparation phase of SDP. Nonetheless, existing FS methods suffer from issues such as insignificant dimensionality reduction, low accuracy in classifying chosen optimal feature sets, and neglect of complex interactions and dependencies between defect data and features as well as between features and classes. To tackle the aforementioned problems, this paper proposes a many‐objective SDPFS (MOSDPFS) model and the binary many‐objective PSO algorithm with adaptive enhanced selection strategy (BMaOPSO‐AR2) is proposed within this paper. MOSDPFS selects F1 score, the number of features within subsets, and correlation and redundancy measures based on mutual information (MI) as optimization objectives. BMaOPSO‐AR2 constructs a binary version of MaOPSO using transfer functions specifically for binary classification. Adaptive update formulas and the introduction of the R2 indicator are employed to augment the variety and convergence of algorithm. Additionally, performance of MOSDPFS and BMaOPSO‐AR2 are tested on the NASA‐MDP and PROMISE datasets. Numerical results prove that a proposed model and algorithm effectively reduces feature count while enhancing predictive accuracy and minimizing model complexity.

Summary Exploring the associations between microRNAs (miRNAs) and diseases can identify potential disease features. Prediction of miRNA‐skin cancer associations has become an effective method for detecting skin cancer, as direct detection of skin cancer is challenging. However, traditional binary associations prediction methods overlook high‐order feature differences of miRNAs in different types of skin cancer. Although current tensor decomposition methods have addressed this, they assume a consistent composition standard of global tensor elements, ignoring differences in the composition standards of local sub‐tensors. This leads to poor prediction accuracy and comprehensiveness and fails to consider the credibility and diversity requirements of patients and doctors in practical applications. In this paper, we represent miRNA‐skin cancer associations as a tensor and employ tensor decomposition for tensor completion to achieve prediction purposes. First, we propose a credibility evaluation indicator and introduce four objective functions: accuracy, comprehensiveness, credibility, and diversity, to construct a many‐objective local tensor factorization model (MOLTF). Then, to avoid wrong individuals when solving this model with genetic algorithms, we propose a corrected single‐point crossover operator and a corrected multi‐point mutation operator. On the miRNA‐disease dataset HMDD v3.2, our algorithm improves accuracy by 14.5% compared to the recent baseline, demonstrating its effectiveness.

Summary Existing research on recommender systems primarily focuses on improving a single objective, such as prediction accuracy, often ignoring other crucial aspects of recommendation performance such as temporal factor, user satisfaction, and acceptance. To solve this problem, we proposed an explicable recommendation model using many‐objective optimization and a time‐assisted knowledge graph, which utilizes user interaction times within the graph to prioritize recommending recently frequently visited items and is further optimized using a many‐objective optimization algorithm. In this model, the temporal weight of user actions at different times is first determined through a time decay function. Additionally, if a user clicks on the same item again, the current action's temporal weight is set to one. This strategy prioritizes recent user actions and frequently visited items, reflecting current interests and preferences better. Next, the created knowledge graph is used to create a list of potential recommendations. Embedding methods obtain the vectors for entities and relations in the path. These vectors, combined with the temporal weight of actions, quantify the explainability of user recommendations. Optimizing the rest of the recommendation performance with many objective algorithms while focusing on the user's recent frequent visits to the item. Finally, the outcomes of the research study indicate that, compared to other explicable recommended methods, our model, considering temporal factor, improved average accuracy by 11%, diversity by 1%, and explainability by 21% in the Useraction1 data set. Results in other data sets also indicate that the proposed model maintains accuracy, diversity, and novelty while enhancing explainability.

Summary Person re‐identification based on text description is a critical task in modern security systems. However, existing methods primarily focus on performance and overlook the crucial aspect of retrieval efficiency. In this article, we propose a novel two‐stage multimodal re‐discovery algorithm called DCH‐ReID, which leverages attention hashing. First, we introduce a chunked mapping hash learning method that effectively mitigates confusion between hash codes. Second, we propose a hash learning approach based on the channel attention mechanism, assigning higher binary bit weights to important body parts. Finally, to balance retrieval performance and time efficiency, we present a two‐stage retrieval scheme. Through extensive experiments on the CUHK‐PEDES benchmark dataset, we validate that our proposed DCH‐ReID algorithm exhibits superior efficiency and higher accuracy compared to current mainstream text‐based pedestrian re‐identification algorithms.

Summary In many‐objective optimization algorithms, it is very important to maintain significant convergence and diversity of the population. And with the increasing demand in various fields, the optimization problem also becomes gradually complicated. Some existing many‐objective optimization algorithms are faced with challenges such as domination resistance and dimensional crisis. To solve these challenges, a many‐objective optimization algorithm based on dual criteria and mixed distribution correction strategy (MaOEA‐CSMDC) is proposed in this paper. To be specific, a matching selection strategy based on dual criteria combined by pareto domination strategy and achievement scalar function, which alleviates the domination resistance phenomenon and enhances the selection pressure of the algorithm. After that, an environment selection strategy based on equal probability mixed distribution correction is designed to better balance convergence and diversity. In this strategy, normal distribution, exponential distribution, and Cauchy distribution are introduced to adjust the weight of convergence and diversity in evolution by means of equal probability, so as to alleviate the problem that the conflict between them is intensified in the later stage of the algorithm. The experimental results show that, MaOEA‐CSMDC not only has advantages in convergence and diversity indicators, but also is more competitive in solving many‐objective optimization problems.

This article establishes an edge computing architecture based on blockchain sharding to apply blockchain technology at the edge layer. The tasks offloaded to the edge layer are performed by a set of edge server nodes for consensus operations, which improves the security of offloading. At the same time, the nodes and offloaded tasks are divided into multiple shards, and the typical practical Byzantine fault tolerance (PBFT) consensus is performed in each shard to improve scalability. In order to avoid the impact of malicious nodes in an unreasonable sharding scheme on network security and performance, we model the many-objective optimization sharding problems, which includes reducing consensus latency, energy consumption, sharding failure probability, and improving sharding throughput. Moreover, we design a many-objective evolutionary algorithm based on information entropy (MaOEA-IE) to solve the model. In the process of population environment selection, the distribution information of individuals is mapped to a Gaussian function, and we aggregate the distribution functions of all individuals and calculate the information entropy to measure the distribution of the population. The simulation results of benchmark test problems and model solving problems show that the solution set of MaOEA-IE has the best convergence, diversity, and comprehensive performance. This article provides an idea for the formulation of blockchain sharding scheme.

As an application area of social computing, social recommendation aims to exploit the richness of social relationships to improve recommendation accuracy. Current research mainly considers social information that can be directly observed, with little attention to indirect social relationships between users or the explainability of social recommendation results. To address this challenge, this article proposes a knowledge graph-based many-objective model for explainable social recommendation (KGMESR) by considering the explainability, accuracy, novelty, and content quality of social recommendation results. The model takes advantage of social behavior information to calculate user similarity and quantifies the explainability of social recommendation results using entity vectors and embedding vectors. To ensure model efficiency, a many-objective recommendation algorithm based on the partition deletion strategy is designed. It employs the association of individuals with the nearest reference vector to render the diversity of the population and then obtains the final solution by deleting poorly converged individuals in each partition. Experimental results show that many-objective optimization recommendation algorithm based on partition deletion strategy (MaOEA-PDS) allows for preferable recommendation results for users in real datasets. The explainability of the proposed model is demonstrated by two case studies.

The rapid progress of artificial intelligence expands its wide applicability in Internet of Things (IoT). Meanwhile, data insufficient and data source privacy are key supply chain challenges facing IoT especially in the healthcare industry. To address this problem in healthcare IoT, in this article, we propose a skin cancer detection model based on federated learning integrated with deep generation model. First, we employ dual generative adversarial networks to address the problem of insufficient data. In addition, to improve the quality of generated images, we synchronously optimize the sharpness of images, Frechet inception distance, image diversity, and loss using knee point-driven evolutionary algorithm (KnEA). Then, we protect patient information privacy by training federated skin cancer framework. Finally, we employ the ISIC 2018 dataset to test the performance of the proposed training model under different situations, including using identically distributed data, nonidentically distributed data, a sparse convolutional neural network, and a fully connected convolutional neural network. The experiment results demonstrate that the accuracy and area under the curve reach 91% and 88%, respectively. This model can help resolve problems of insufficient data in smart medicine of IoT and protect the privacy of user data while also providing an excellent detection rate.

Internet of Things (IoT) is a huge network and establishes ubiquitous connections between smart devices and objects. The flourishing of IoT leads to an unprecedented data explosion, traditional data storing or processing techniques have the problem of low efficiency, and if the data are used maliciously, the security loss may be further caused. Multicloud is a high-performance secure computing platform, which combines multiple cloud providers for data processing, and the distributed multicloud platform ensures the security of data to some extent. Based on multicloud and task scheduling in IoT, this article constructs a many-objective distributed scheduling model, which includes six objectives of total time, cost, cloud throughput, energy consumption, resource utilization, and balancing load. Furthermore, this article presents a many-objective intelligent algorithm with sine function to implement the model, which considers the variation tendency of diversity strategy in the population is similar to the sine function. The experimental results demonstrate excellent scheduling efficiency and hence enhancing the security. This work provides a new idea for addressing the difficult problem of data processing in IoT.

The traditional coal energy system cannot meet the requirements of modern industrial production for sustainable development because extensive economic growth has caused significant coal consumption. Therefore, it is particularly important to formulate an effective coal production decision-making scheme to support complex coal production systems for sustainable development. To address this challenge, an improved many-objective fuzzy decision-making model with human participation for coal production prediction is established in this article. The model includes five objective functions: economic, energetic, environmental, coal gangue, and safety profits. Moreover, a novel multistage many-objective optimization algorithm is designed to adjust relevant model parameters and make the obtained model solution more accurate when compared with involved algorithms. In the algorithm, there are three stages of optimization. In stage one, the model with the relatively good convergence solution is chosen. In stage two, the diversity of the model solution needs to be retained by employing a diversity maintenance mechanism. In stage three, a comprehensive measurement approach is designed to ensure the balance of convergence and diversity during population evolution. To verify the validity of the model and the superiority of the optimization algorithm, five other advanced many-objective algorithms are used for comparison. The results from simulations on a benchmark function show that the proposed optimization algorithm has better performance than involved algorithms. Model solutions obtained on different metrics have better convergence and diversity for the coal fuzzy decision-making problem.

While the industrial Internet of Things (IIoT) can support efficient control of the physical world through large amounts of industrial data, data security has been a challenge due to various interconnections and accesses. Blockchain technology can support security and privacy preservation in IIoT data with its trusted and reliable security mechanism. Sharding technology can help improve the overall throughput and scalability of blockchain networks. However, the effectiveness of sharding is still challenging due to the uneven distribution of malicious nodes. By aiming to improve the performance of blockchain networks and reduce the possibility of malicious node aggregation, in this article, we propose a many-objective optimization algorithm based on the dynamic reward and penalty mechanism (MaOEA-DRP) to optimize the shard validation validity model. Then, an optimal blockchain sharding scheme is obtained. Compared with other state-of-the-art many-objective optimization algorithms, MaOEA-DRP performs better on the DTLZ test suite. The simulation results demonstrate that our proposed algorithm can significantly improve the throughput and validity of sharding for better security in the blockchain-enabled IIoT.

Summary Wireless sensor networks (WSN) have high value in the field of wireless communications. As the earliest WSN clustering protocol, Low Energy Adaptive Clustering Hierarchy (LEACH) can effectively reduce the energy consumption of data transmission in sensor networks. However, LEACH has some problems such as cluster head nodes are unevenly distributed. In this paper, a unified heuristic bat algorithm (UHBA) is proposed to optimize elections in cluster heads. This algorithm guarantees that the election of cluster heads can freely transform both global search and local search. Meanwhile, comparing with several other variants of the bat algorithm in CEC2013 test suite, it can be seen from results that UHBA has better performance. Moreover, the application of the algorithm on LEACH is better than other algorithms, which further proves that the algorithm has better results.

Summary Both the problem of class imbalance in datasets and parameter selection of Support Vector Machine (SVM) are crucial to predict software defects. However, there is no one working to solve these problems synchronously at present. To tackle this problem, a hybrid multi‐objective cuckoo search under‐sampled software defect prediction model based on SVM (HMOCS‐US‐SVM) is proposed to solve synchronously above two problems. Firstly, a hybrid multi‐objective cuckoo search with dynamical local search (HMOCS) is utilized to select synchronously the non‐defective sampling and optimize the parameters of SVM. Then, three under‐sampled methods for decision region range are proposed to select the non‐defective modules. In the simulation, the three indicators, including the false positive rate (pf), the probability of detection (pd), and G‐mean, are employed to measure the performance of the proposed algorithm. In addition, eight datasets from Promise database are selected to verify the proposed software defect predication model. Comparing with the result of eight prediction models, the proposed method comes into effect on solving software defect prediction problem.

Recommendation technology is an important part of the Internet of Things (IoT) services, which can provide better service for users and help users get information anytime, anywhere. However, the traditional recommendation algorithms cannot meet user's fast and accurate recommended requirements in the IoT environment. In the face of a large-volume data, the method of finding neighborhood by comparing whole user information will result in a low recommendation efficiency. In addition, the traditional recommendation system ignores the inherent connection between user's preference and time. In reality, the interest of the user varies over time. Recommendation system should provide users accurate and fast with the change of time. To address this, we propose a novel recommendation model based on time correlation coefficient and an improved K-means with cuckoo search (CSK-means), called TCCF. The clustering method can cluster similar users together for further quick and accurate recommendation. Moreover, an effective and personalized recommendation model based on preference pattern (PTCCF) is designed to improve the quality of TCCF. It can provide a higher quality recommendation by analyzing the user's behaviors. The extensive experiments are conducted on two real datasets of MovieLens and Douban, and the precision of our model have improved about 5.2 percent compared with the MCoC model. Systematic experimental results have demonstrated our models TCCF and PTCCF are effective for IoT scenarios.

Internet of Things (IoT) equipment is usually in a harsh environment, and its security has always been a widely concerned issue. Node identity authentication is an important means to ensure its security. Traditional IoT identity authentication protocols usually rely on trusted third parties. However, many IoT environments do not allow such conditions, and are prone to single point failure. Blockchain technology with decentralization features provides a new solution for distributed IoT system. In this paper, a blockchain based multi-WSN authentication scheme for IoT is proposed. The nodes of IoT are divided into base stations, cluster head nodes and ordinary nodes according to their capability differences, which are formed to a hierarchical network. A blockchain network is constructed among different types of nodes to form a hybrid blockchain model, including local chain and public chain. In this hybrid model, nodes identity mutual authentication in various communication scenarios is realized, ordinary node identity authentication operation is accomplished by local blockchain, and cluster head node identity authentication are realized in public blockchain. The analysis of security and performance shows that the scheme has comprehensive security and better performance.

Summary It is difficult to protect users' privacy and to process private information due to the complexity and uncertainty of such information. To protect private information quickly and accurately, a many‐objective optimization algorithm framework based on the hybrid elite selection strategy is proposed in this paper. First, a mating selection mechanism combined with the achievement scale function and angle information index is used to generate elite offspring of the internal population. Then, the balanceable fitness estimation method is employed to select and update the external archive. To test performance, the proposed algorithm is tested on many‐objective optimization problems (MaOPs) and compared with five state‐of‐the‐art algorithms. Experimental simulation results show that the proposed algorithm is more effective in solving MaOPs and can inspire development of a better privacy protection strategy.

With the development of the Internet, malicious code attacks have increased exponentially, with malicious code variants ranking as a key threat to Internet security. The ability to detect variants of malicious code is critical for protection against security breaches, data theft, and other dangers. Current methods for recognizing malicious code have demonstrated poor detection accuracy and low detection speeds. This paper proposed a novel method that used deep learning to improve the detection of malware variants. In prior research, deep learning demonstrated excellent performance in image recognition. To implement our proposed detection method, we converted the malicious code into grayscale images. Then, the images were identified and classified using a convolutional neural network (CNN) that could extract the features of the malware images automatically. In addition, we utilized a bat algorithm to address the data imbalance among different malware families. To test our approach, we conducted a series of experiments on malware image data from Vision Research Lab. The experimental results demonstrated that our model achieved good accuracy and speed as compared with other malware detection models.

Integral-controlled particle swarm optimization (ICPSO) is an effective variant of particle swarm optimization (PSO) aiming to increase the population diversity. Due to the additional accelerator items, the behavior of ICPSO is more complex, and provides more chances to escaping from a local optimum than the standard version of PSO. However, many experimental results show the performance of ICPSO is not always well because of the particles' un-controlled movements. Therefore, a new variant, integral particle swarm optimization with dispersed accelerator information (IPSO-DAI) is designed to improve the computational efficiency. In IPSO-DAI, a predefined predicted velocity index is introduced to guide the moving direction. If the average velocity of one particle is superior to the index value, it will choice a convergent manner, otherwise, a divergent manner is employed. Furthermore, the choice of convergent manner or divergent manner for each particle is associated with its performance to fit different living experiences. Simulation results show the proposed variant is more effective than other three variants of particle swarm optimization especially for multi-modal numerical problems. The IPSO-DAI algorithm is also applied to directing the orbits of discrete chaotic dynamical systems by adding small bounded perturbations, and achieves the best performance among four different variants of PSO.

Particle swarm optimizer is a novel algorithm where a population of candidate problem solution vectors evolves "social" norms by being influenced by their topological neighbors. The standard particle swarm optimizer (PSO) may prematurely converge on suboptimal solutions that are not even guaranteed to be local extrema. A new particle swarm optimizer, called stochastic PSO (SPSO), which combined with tabu technique is presented based on the analysis of the standard PSO. And because of its local search capability, the SPSO is more efficient. And the global convergence analysis is made using the F. Solis and R. Wets' research results. Finally, several examples are simulated to show that SPSO is more efficient than the standard PSO.