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.

Summary Charging path planning in wireless sensor networks (WSNs) refers to designing an efficient charging path for sensor nodes in the network. However, most charging schemes mainly consider the planning of charging paths and pay little attention to the impact of uncertainties, such as road conditions and environment on the planning of charging paths, as well as ignoring the charging problem of new nodes in need of charging. Road conditions and the environment directly affect the energy consumption of wireless charging vehicles (WCVs) during traveling. To address the aforementioned challenges, this article proposes an interval many‐objective charging path scheme model, the WCV consumption is an uncertain value, it will change according to the environment, and road conditions, so we represent it as an interval parameter with upper and lower bounds. An interval high‐dimensional multi‐objective model with target energy consumption, path distance, number of dead nodes, and communication delay is constructed. Second, to implement this model, an interval SPEA2 algorithm (I‐SPEA2) that introduces an environmental response mechanism is proposed. I‐SPEA2 treats individual target interval values as ranges of values on a two‐dimensional coordinate axis, forming a quadrilateral, calculates individual size probabilities based on the area to determine the dominant relationship, and combines fixed distance and interval overlap to eliminate redundant individuals. The simulation results show that the interval dynamic model is effective in prolonging the lifecycle of WSN as well as the proposed algorithm reduces the mortality rate of the nodes by 15%, 28%, 13%, 16%, and 21% compared with other algorithms.

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.

Cloud platforms scheduling resources based on the demand of the tasks submitted by the users, is critical to the cloud provider's interest and customer satisfaction. In this paper, we propose a multi-objective cloud task scheduling algorithm based on an evolutionary multi-factorial optimization algorithm. First, we choose execution time, execution cost, and virtual machines load balancing as the objective functions to construct a multi-objective cloud task scheduling model. Second, the multi-factor optimization (MFO) technique is applied to the task scheduling problem, and the task scheduling characteristics are combined with the multi-objective multi-factor optimization (MO-MFO) algorithm to construct an assisted optimization task. Finally, a dynamic adaptive transfer strategy is designed to determine the similarity between tasks according to the degree of overlap of the MFO problem and to control the intensity of knowledge transfer. The results of simulation experiments on the cloud task test dataset show that our method significantly improves scheduling efficiency, compared with other evolutionary algorithms (EAs), the scheduling method simplifies the decomposition of complex problems by a multi-factor approach, while using knowledge transfer to share the convergence direction among sub-populations, which can find the optimal solution interval more quickly and achieve the best results among all objective functions.

MOTIVATION: Single cell RNA-sequencing (scRNA-seq) technology enables whole transcriptome profiling at single cell resolution and holds great promises in many biological and medical applications. Nevertheless, scRNA-seq often fails to capture expressed genes, leading to the prominent dropout problem. These dropouts cause many problems in down-stream analysis, such as significant increase of noises, power loss in differential expression analysis and obscuring of gene-to-gene or cell-to-cell relationship. Imputation of these dropout values can be beneficial in scRNA-seq data analysis. RESULTS: In this article, we model the dropout imputation problem as robust matrix decomposition. This model has minimal assumptions and allows us to develop a computational efficient imputation method called scRMD. Extensive data analysis shows that scRMD can accurately recover the dropout values and help to improve downstream analysis such as differential expression analysis and clustering analysis. AVAILABILITY AND IMPLEMENTATION: The R package scRMD is available at https://github.com/XiDsLab/scRMD. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Whole-genome sequencing (WGS) is widely used for copy number variation (CNV) detection. However, for most bacteria, their circular genome structure and high replication rate make reads more enriched near the replication origin. CNV detection based on read depth could be seriously influenced by such replication bias. RESULTS: We show that the replication bias is widespread using ∼200 bacterial WGS data. We develop CNV-BAC (CNV-Bacteria) that can properly normalize the replication bias and other known biases in bacterial WGS data and can accurately detect CNVs. Simulation and real data analysis show that CNV-BAC achieves the best performance in CNV detection compared with available algorithms. AVAILABILITY AND IMPLEMENTATION: CNV-BAC is available at https://github.com/XiDsLab/CNV-BAC. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.