In recent years, adversarial attacks in hyperspectral image (HSI) classification have garnered increasing attention. However, existing attack methods primarily manipulate individual pixel spectral to mislead deep neural networks (DNNs) into misclassification, overlooking the physical consistency of hyperspectral data. This oversight results in adversarial samples that lack physical interpretability and suffer from low attack efficiency. To alleviate these issues, this paper proposes a sparse unmixing guided adversarial attack framework (SUGAA) to efficiently generate hyperspectral adversarial samples that satisfy physical consistency. The proposed framework first employs sparse unmixing to extract the abundance matrix of HSI, introducing adversarial perturbations to the abundance matrix to generate physically consistent adversarial samples. Additionally, SUGAA leverages the compositional similarity of materials within intra-class HSI pixels to design a class-specific perturbation generation strategy, enhancing the applicability of adversarial perturbations across pixels of the same class. To further improve optimization effectiveness, SUGAA incorporates a class-specific perturbation optimization algorithm based on momentum iterative gradients to avoid local optima, ensuring stable and efficient perturbation generation. Experimental results on real HSI datasets demonstrate that SUGAA not only generates adversarial samples with high attack performance and physical consistency but also exhibits robustness to common preprocessing transformations.

Large language models (LLMs) have demonstrated remarkable capabilities across various natural language processing tasks, but they remain vulnerable to adversarial attacks and pose significant security concerns. Existing attack methods often treat adversarial prompts as flat sequences, neglecting the rich hierarchical structure of natural language, which could limit their effectiveness. Advancing the methodologies for adversarial attacks is crucial for rigorously assessing the security of LLMs and identifying subtle vulnerabilities. This paper introduces AdvGP, a novel framework that leverages genetic programming (GP) to generate adversarial prompts for LLMs. AdvGP exploits the inherent structural similarities between GP trees and natural language syntax to optimize the structure of harmful prompts. The framework incorporates a multi-granularity hierarchical attack strategy, specialized genetic operators that leverage an assisting LLM for depth-aware crossover and multi-level mutation, and a comprehensive fitness function integrating semantic consistency and attack effectiveness. The proposed method achieves competitive attack performance on multiple LLMs, consistently generating harmful outputs despite higher perplexity than some baselines. Ablation studies confirm the significant contributions of both LLM-aided and depth-aware mechanisms to AdvGP’s effectiveness. Furthermore, transferability analysis reveals that the generated prompts are able to bypass the defenses of various state-of-the-art LLMs, such as ChatGPT and Gemini.

For expensive multiobjective optimization problems, there exists useful knowledge, e.g., the trained surrogate models, can be transferred to assist the optimization of a target optimization problem, which is termed as multi-problem surrogates. Stacking transfer is able to combine the pretrained source surrogate models and the preliminary target model with a meta-regression algorithm to transfer knowledge from source to target. However, when large-scale source models are involved in the many-problem scenarios, the less correlated sources may hurt the target performance, which is known as negative transfer. In this paper, sparse representation of the coefficients of meta-regression is considered to automatically select the most relevant source models for largely avoiding negative transfer. In the proposed many-problem surrogates, the coefficients of the source and target models are assumed to be sparse under the non-negativity and sum-to-one constraints. Then a sparse transfer stacking model is established with l1-norm of the coefficients. Next, the alternating direction method of multipliers is employed to solve the resulting constrained optimization problem by converting it into several much simpler problems. Most of the previous works assume that the costs for evaluation have no much difference and this assumption rarely holds in the real-world applications. In order to further reduce the total costs, an improved surrogate model with a cost-sensitive measure is designed to estimate the cost and select new solutions for real evaluation based on their estimated fitness, uncertainty and cost. Experimental results on synthetic and practical problems have demonstrated the superiority of the proposed many-problem surrogates.

Data-driven evolutionary algorithms (DDEAs) have achieved significant success in numerous real-world optimization problems, where exact objective functions and constraint functions do not exist, and they mainly rely on available data. However, the existing DDEAs primarily focus on improving performance through data and surrogate, without considering that the users may lack the specialized domain knowledge and sufficient computing resources required for DDEAs. To address the aforementioned issues, this paper proposes a novel paradigm called Evolutionary Learning and Optimization as a Service (ELOaaS) and investigates the potential collusion attacks between machine learning modules and evolutionary computing modules on cloud server, which may lead to privacy leakage. Consequently, a privacy-enhanced DDEA (PEDDEA) is proposed as an instantiation algorithm of ELOaaS, which is designed to tackle offline data-driven evolutionary optimization within the ELOaaS paradigm. In the proposed PEDDEA, a subspace learning-based privacy protection strategy is designed to defense the collusion attacks. Additionally, a model management strategy based on Kendall tau metric is introduced to construct high-quality surrogate ensembles. PEDDEA enables users to outsource private offline data to cloud servers, thereby approaching the optimal solution while ensuring privacy protection. Comprehensive experiments are conducted on benchmark problems and safety evaluation problems of autonomous vehicles. According to the experimental results, the proposed algorithm has significant performance advantages over existing offline DDEAs while ensuring privacy protection.

Multimodal freight transportation is essential for enhancing logistics efficiency and reducing costs, with route optimization as its core component. However, uncertainties are prevalent in multimodal systems, posing challenges for the construction and validation of simulation models. Furthermore, the involvement of multiple stakeholders introduces conflicting optimization objectives. Effectively balancing these objectives to maximize overall benefits has become a critical issue that requires resolution. For the multimodal transport route optimization problem in hybrid uncertainty environments (e.g., there are uncertainties in transportation demand, transportation time, and transfer time), this study constructs a multiobjective optimization model based on fuzzy numbers. The complexity of the model is reduced by introducing the chance-constrained programming theory. To solve the model, a data-driven multi-objective evolutionary algorithm is designed, integrating Monte Carlo simulation with surrogate models to effectively reduce the computational cost of uncertainty estimation. Furthermore, a constraint prioritization strategy is developed to handle multiple conflict objectives, and complex constraints efficiently. Simulation results demonstrate that the proposed algorithm exhibits excellent performance across networks of varying scales, providing robust decision support for multimodal transportation decision-making.

Recent years have witnessed a surge of interest in solving combinatorial optimization problems (COPs) using machine learning techniques. Motivated by this trend, we propose a learning-augmented exact approach for tackling an NP-hard COP, the Orienteering Problem with Time Windows, which aims to maximize the total score collected by visiting a subset of vertices in a graph within their time windows. Traditional exact algorithms rely heavily on domain expertise and meticulous design, making it hard to achieve further improvements. By leveraging deep learning models to learn effective relaxations of problem restrictions from data, our approach enables significant performance gains in an exact dynamic programming algorithm. We propose a novel graph convolutional network that predicts the directed edges defining the relaxation. The network is trained in a supervised manner, using optimal solutions as high-quality labels. Experimental results demonstrate that the proposed learning-augmented algorithm outperforms the state-of-the-art exact algorithm, achieving a 38% speedup on Solomon’s benchmark and more than a sevenfold improvement on the more challenging Cordeau’s benchmark.

Transfer evolutionary multiobjective optimization leverages the relevant knowledge from other source problems (distinct but possibly related) to assist the optimization of the target problem of interest. Multi-problem surrogates stack multiple source surrogates to reduce the number of function evaluations of the target expensive problem. The current multi-problem surrogates only considers several source problems and the source and target problems are assumed to be homogeneous. In order to address the above issues, this paper proposes fast heterogeneous multi-problem surrogates for transfer evolutionary multiobjective optimization with a large number of surrogates. First, an iterative surrogate selection strategy is designed to select the highly relevant surrogates from the large-scale surrogate pool to avoid negative transfer. Second, heterogeneous multi-problem surrogates are established to align the features of the source and target models. Finally, an adaptive k-fold cross-validation method is proposed to obtain the predicted values of the target model with low computational costs. Experiments on the multiobjective optimization benchmark problems and multiobjective neural architecture search problems have demonstrated that the proposed method is able to avoid negative transfer in the large-scale scenarios and reduce the computational costs.

Hyperspectral imaging has demonstrated substantial advantages in enhancing classification performance in remote sensing applications due to its abundant spectral information. To address the challenges of label noise and class imbalance in hyperspectral image (HSI) classification, we propose an end-to-end Feature-Guided Network (FGN) for HSI. Instead of merely combining spatial and channel attention, FGN leverages feature-level attention interactions to enhance contextual understanding, leading to better feature extraction, especially for underrepresented classes. Furthermore, a bidirectional loss for curriculum learning (CL) is proposed to rank the HSI training data in a descending or ascending order. The top and bottom loss regularizers are designed to make the proposed model suitable for noisy and imbalanced HSI data distributions. In the phase of selecting pace parameter, a stacking ensemble curriculum learning (SECL) model is established to avoid that the outliers and noisy HSI data are involved into the CL training process. A novel instruction matrix based on sample weights is designed for base classifiers. The outputs of the base models, combined with the expected labels, form the input-output pairs for training the second-level classifier. Experiments conducted on multiple hyperspectral imbalanced datasets with noisy labels demonstrate the superior performance of our method.

DNN have demonstrated vulnerability to adversarial attacks in object detection tasks. While significant progress has been made in single-spectrum attacks, cross-spectral adversarial attacks remain challenging due to the complex tradeoffs between visible and infrared domains. To address this, an evolutionary multiobjective cross-spectral attack (MoXAttack) framework, for developing adversarial patches in closed-box cross-spectral scenarios is proposed. MoXAttack incorporates a multipopulation constraint-handling technique, which uses both penalty functions and feasibility rules to guide the search process. Spectrum-aware genetic operators are introduced to enhance solution diversity and feasibility. The framework automatically optimizes the smooth to cross-spectral shared patch shape using curvature energy. In addition, MoXAttack utilizes SVD for visible spectrum texture perturbations and adjustable thermal shielding material thickness for infrared spectrum control. Experiments on the LLVIP dataset demonstrate that MoXAttack achieves competitive performance across multiple object detection models. Ablation studies reveal the positive impact of improved components on attack effectiveness. The multipatch strategy improves attack success rates by at least 17%, while optimized patch shapes outperform conventional geometric shapes by at least 25% in terms of mAP drop. In the physical world test, the proposed method shows stability in different viewing angles.

This article proposes a novel evolutionary multitasking optimization (EMTO) paradigm called divide-and-conquer EMTO, which divides the original complex optimization problem into multiple simple optimization tasks and then these tasks are optimized by EMTO concurrently to formulate the resulting solution of the original problem. The main characteristics of divide-and-conquer EMTO are that the considered problem can be divided into multiple small-scale optimization tasks and the optimal solution is the combination of solutions of all tasks. In order to achieve the optimal combined fitness of all tasks, a relative improvement function and an adaptive exploration optimization strategy are designed for dynamic resource allocation across tasks. Finally, a case study on hyperspectral unmixing is investigated in the proposed divide-and-conquer EMTO framework by dividing the hyperspectral image into several homogeneous regions to formulate multiple sparse unmixing tasks. Experiments on benchmark and sparse unmixing problems demonstrate the superiority of divide-and-conquer EMTO.

Evolutionary multitasking optimization (EMTO) is a new optimization paradigm proposed in the field of evolutionary computation in recent years. EMTO can solve several different optimization tasks simultaneously and facilitate superior convergence characteristics by transferring effective knowledge among the tasks. However, existing EMTO usually focuses only on facilitating convergence characteristics while neglecting the potential privacy leakage problem in the knowledge transfer between different tasks. The privacy leakage could result in considerable financial losses or severe reputation impairment, which may impede the development of EMTO in real-world applications. To solve the problem of privacy leakage in EMTO, this paper proposes a privacy-enhanced multitasking particle swarm optimization algorithm. A knowledge transfer strategy with privacy preservation is designed based on homomorphic encryption by combining multitasking particle swarm optimization. In addition, an inter-task knowledge transfer mechanism implemented in a low-dimensional subspace is introduced to reduce the extra computational burden caused by privacy preservation. Comprehensive experiments are conducted on synthetic and NAS problems to verify the effectiveness of the proposed method. According to the experimental results, the proposed method has remarkable advantages in privacy preservation compared to existing EMTO.

Multiobjective neural architecture search (MONAS) methods based on evolutionary algorithms (EAs) are inefficient when the evaluation of each architecture incorporates parameter learning from scratch. A surrogate-assisted MONAS problem can be tough considering cold-start in surrogate construction, and the evaluation of predicted promising architectures could still be cumbersome. Previously solved MONAS problems are likely to convey useful knowledge that could assist solving the current MONAS problem. To take the benefit from knowledge of these previous practices, a framework tackling large-scale knowledge transfer is proposed. Through sparse-constraint transfer stacking, the surrogate for the current problem gets informative easily. With knee-region knowledge distillation from previously learned parameters of nondominated architectures, evaluation of current architectures could be efficient and credible. To avoid transferring knowledge from irrelevant problems, an iterative source selection algorithm is designed to avoid negative transfer. The proposed framework is analyzed under different source and target MONAS problem combinations. Results show that with the help of this framework, architectures with competitive performance could be found under limited evaluation budget.

Classification of multitemporal remote sensing (MTRS) images with only a few labels of one of these images has attracted widespread interest in recent years. It usually confronts three problems: domain increment, class increment, and class disappearance. In this article, a robust self-paced incremental learning (RSPIL) is proposed to alleviate the above problems. First, change detection is used to transfer labels from the source image to the target one for formulating a combined training set. Then, the weighted classification loss and the distillation loss are considered to ensure classification performance and minimal forgetting. In particular, a novel entropy-inhibit loss is proposed to suppress the classification capability for the disappearing classes. These losses are combined with self-paced learning (SPL) by introducing a weight variable to measure the “easiness” of the training samples, which is able to automatically acquire accurate decision boundaries from easy to hard since the combined training set generated by change detection contains noisy samples and outliers. Finally, a nearest-average-eigenvector classifier and an exemplar set management strategy based on the sample weights are designed to alleviate catastrophic forgetting (CF). Twenty-four MTRS image datasets from four areas are considered in the experiments. The classification results demonstrate that the proposed method is able to alleviate CF and achieves significant improvements on multitemporal image datasets.

The agile earth observation satellite scheduling problem (AEOSSP) with time-dependent transition times is a complex combinational optimization problem that has emerged from the development of large-scale satellite management techniques. To address this problem, we propose a deep reinforcement learning-based construction model (DRL-CM) that consists of five parts: 1) a Markov decision process (MDP); 2) a feature engineering; 3) a constructive heuristic neural network (CHNN); 4) an RL training method; and 5) an evaluation system. Specifically, the CHNN comprises six modules containing three special components that we propose: a dynamic encoder, a dynamic global layer, and a two-stage attention layer. First, we build the MDP of the AEOSSP and the feature engineering with effective features required for decision-making. Second, we design the CHNN to function as the MDP policy and train it with an RL model. Finally, we propose a comprehensive evaluation system for the validation of our model. The experimental results indicate that the proposed DRL-CM outperforms the state-of-the-art algorithm in terms of both optimization speed and quality. In addition, the feature engineering and network architecture built in our model are verified to be effective in comprehensive experiments.

Multitype satellite observation, including optical observation satellites, synthetic aperture radar (SAR) satellites, and electromagnetic satellites, has become an important direction in integrated satellite applications due to its ability to cope with various complex situations. In the multitype satellite observation scheduling problem (MTSOSP), the constraints involved in different types of satellites make the problem challenging. This article proposes a mixed-integer programming model and a generalized profit representation method in the model to effectively cope with the situation of multiple types of satellite observations. To obtain a suitable observation plan, a deep reinforcement learning-based genetic algorithm (DRL-GA) is proposed by combining the learning method and genetic algorithm. The DRL-GA adopts a solution generation method to obtain the initial population and assist with local search. In this method, a set of statistical indicators that consider resource utilization and task arrangement performance are regarded as states. By using deep neural networks to estimate the$Q$value of each action, this method can determine the preferred order of task scheduling. An individual update strategy and an elite strategy are used to enhance the search performance of DRL-GA. Simulation results verify that DRL-GA can effectively solve the MTSOSP and outperforms the state-of-the-art algorithms in several aspects. This work reveals the advantages of the proposed generalized model and scheduling method, which exhibit good scalability for various types of observation satellite scheduling problems.

End-to-end deep clustering method utilizes deep neural networks to jointly learn representation features and clustering assignments. Although many k-means-friendly deep clustering models have been explored, the existing division-based methods tend to directly implement clustering with a specific number of clusters, which suffers from poor performance resulted from indistinguishable clusters, and contributes to bad local optimum. At the same time, the representation learning of fuzzy$c$-means clustering in the feature space still needs more research. In this article, a deep fuzzy curriculum clustering method with the learning strategy of clustering from easy to complex automatically is proposed to tackle the above issues. First, considering the soft flexible allocation of fuzzy$c$-means and the preservation of local structure of original data, the fuzzy clustering loss and the autoencoder's reconstruction loss are constructed to learn the embedded features and clustering centers simultaneously. Second, curriculum loss is introduced into the constraint to make clusters successively merge in line with implementing clustering from easy to complex, and realize the bottom-up deep aggregative clustering automatically. In addition, novel curriculum information is proposed as constraint to guide the merging of clusters belonging to the same class. Experimental results on four real-world datasets show the superiority of the proposal.

Classification of remote sensing image series which differ in quality and details, has impportant implications for the analysis of land cover, whereas it is expensive and time-consuming as a result of manual annotations. Fortunately, domain adaptation (DA) provides an outstanding solution to the problem. However, information loss while aligning two distributions often exists in traditional DA methods, which impacts the effect of classification with DA. To alleviate this issue, an inter-domain representation alignment and fine-tuning based network (RAFNet) is proposed for image series classification. Inter-domain representation alignment, which is fulfilled by a variational auto-encoder (VAE) trained by both source and target data, encourages reducing the discrepancy between the two marginal distributions of different domains and simultaneously preserving more data properties. As a result, RAFNet, which fuses the multi-scale aligned representations, performs classification task in the target domain after well trained with supervised learning in the source domain. Specifically, the multi-scale aligned representations of RAFNet is acquired by duplicating the frozen encoder of VAE. Then, an information based loss function is designed to fine-tune RAFNet, in which both the unchanged and changed information implied in change maps is completely used to learn the discriminative features better and make the model more generalized for the target domain. Finally, experiment studies on three datasets validate the effectiveness of RAFNet with considerable segmentation accuracy even the target data has no access to any annotated information.

We investigate a general solution based on reinforcement learning for the agile satellite scheduling problem. The core idea of this method is to determine a value function for evaluating the long-term benefit under a certain state by training from experiences, and then apply this value function to guide decisions in unknown situations. First, the process of agile satellite scheduling is modeled as a finite Markov decision process with continuous state space and discrete action space. Two subproblems of the agile Earth observation satellite scheduling problem, i.e., the sequencing problem and the timing problem are solved by the part of the agent and the environment in the model, respectively. A satisfactory solution of the timing problem can be quickly produced by a constructive heuristic algorithm. The objective function of this problem is to maximize the total reward of the entire scheduling process. Based on the above design, we demonstrate that Q-network has advantages in fitting the long-term benefit of such problems. After that, we train the Q-network by Q-learning. The experimental results show that the trained Q-network performs efficiently to cope with unknown data, and can generate high total profit in a short time. The method has good scalability and can be applied to different types of satellite scheduling problems by customizing only the constraints checking process and reward signals.

The scheduling of agile Earth observation satellites is to select a subset of candidate targets each associated with a profit during their visible time windows in order to maximize the collected profits, under some operational constraints. For each pair of two consecutive observations, a transition time is required to perform a rotating movement of the camera, depending on the start times of the two observations. This time-dependency significantly increases the complexity of the scheduling problem. To solve this problem efficiently, we model the time-dependent transition time and prove that it satisfies the first-in–first-out rule and the triangle inequalities rule. On this basis, we develop a novel hybrid heuristic, called “greedy randomized iterated local search” (GRILS). A specific insert operator, including a fast feasibility check and an assignment procedure are specifically designed to address the operational constraints of the scheduling. Extensive experiments on the single satellite instances and multisatellite instances demonstrate that our algorithm outperforms the state-of-the-art algorithms with respect to solution quality and computation time.

Abstract With the progressive development of satellite image data products, their pricing strategies become more and more important for enterprises to earn profits. The objective of this study is to explore several game pricing methods with risk aversion for pricing of data products in neutrosophic environments. First, to reflect the uncertainty of problem parameters, the idea of neutrosophic variables is adopted. With the aid of neutrosophic variables, the truth, indeterminacy and falsity degrees of players can be intuitively and conveniently obtained. Subsequently, considering the risk aversion of decision makers, the optimistic value theory is introduced into neutrosophic variables for calculating the optimistic value of player's profits. Then, different pricing models are constructed under the Bertrand and Stackelberg game scenarios, respectively. After deriving the corresponding equilibrium equations, some numerical instances are provided to testify the feasibility of our methods. Furthermore, the influences of dissimilar market power structures are examined. Finally, the effects of seven problem parameters and players' confidence levels on pricing results are investigated through sensitivity analyses. The results show that the proposed methods are practicable and can offer guidance for the pricing decision of data products.

Employees' expertise is the basic component of human capital of organizations. As the role of human capital and the understanding of employee development become increasingly vital, research works about the effects of working expertise on development are necessary. This article aims to confirm the effect of expertise and find out how expertise affects development. In this article, we analyze employee development and working expertise through data-driven methods, using a data set of a Chinese state-owned enterprise. In addition to statistical analysis, expertise networks are constructed to discover more insights about the effect of expertise on employee development. Moreover, to further validate and exploit the effect, a prediction model of development potential is proposed based on machine learning. Results of the experiment show that the random forests model with network embedding (RFNE) is effective in identifying excellent employees. Finally, with the help of data-driven analysis of expertise and development, we find that the appropriate post, the right choice, the distinctive competency, as well as the interdisciplinary transfer contribute to employee development.

Batch-processing machines (BPMs) can process a number of jobs at a time, which can be found in many industrial systems. This article considers a single BPM scheduling problem with unequal release times and job sizes. The goal is to assign jobs into batches without breaking the machine capacity constraint and then sort the batches to minimize the makespan. A self-adaptive differential evolution algorithm is developed for addressing the problem. In our proposed algorithm, mutation operators are adaptively chosen based on their historical performances. Also, control parameter values are adaptively determined based on their historical performances. Our proposed algorithm is compared to CPLEX, existing metaheuristics for this problem and conventional differential evolution algorithms through comprehensive experiments. The experimental results demonstrate that our proposed self-adaptive algorithm is more effective than other algorithms for this scheduling problem.

In evolutionary computation, balancing the diversity and convergence of the population for multiobjective evolutionary algorithms (MOEAs) is one of the most challenging topics. Decomposition-based MOEAs are efficient for population diversity, especially when the branch partitions the objective space of multiobjective optimization problem (MOP) into a series of subspaces, and each subspace retains a set of solutions. However, a persisting challenge is how to strengthen the population convergence while maintaining diversity for decomposition-based MOEAs. To address this issue, we first define a novel metric to measure the contributions of subspaces to the population convergence. Then, we develop an adaptive strategy that allocates computational resources to each subspace according to their contributions to the population. Based on the above two strategies, we design an objective space partition-based adaptive MOEA, called OPE-MOEA, to improve population convergence, while maintaining population diversity. Finally, 41 widely used MOP benchmarks are used to compare the performance of the proposed OPE-MOEA with other five representative algorithms. For the 41 MOP benchmarks, the OPE-MOEA significantly outperforms the five algorithms on 28 MOP benchmarks in terms of the metric hypervolume.

To address the large-scale and time-consuming multiple agile earth observation satellite (multi-AEOS) scheduling problems, this article proposes a data-driven parallel scheduling approach, which is composed of a probability prediction model, a task assignment strategy, and a parallel scheduling manner. In this approach, given the historical data of satellite scheduling, a prediction model is trained based on the cooperative neuro-evolution of augmenting topologies (C-NEAT) to predict the probabilities that a task will be fulfilled by different satellites. Driven by the probability prediction model, an assignment strategy is adopted for dividing the multi-AEOS scheduling problem into several single-AEOS scheduling subproblems, which can adaptively assign each task to the satellite with the highest predicted probability and greatly decrease the problem size. In a parallel manner, the single-AEOS scheduling subproblems are optimized, respectively, leading to an acceleration in the optimization efficiency of the original problem. Computational experiments indicate that the proposed approach presents better overall performance than other state-of-the-art methods within a very limited scheduling time. As the two main components of the proposed approach, the prediction model based on C-NEAT and the task assignment strategy also outperform other models with traditional training algorithms and inadaptive assignment strategies, respectively.

Satellite Imaging Scheduling, Satellite Downlinking Scheduling and Ground Resources Scheduling are important components in satellites daily management. Considering the highly interlinking of these three types of scheduling, an Integrated Satellite Scheduling model is formulated and proved NP-complete in this paper. To address the large scale and oversubscription of the Integrated Satellite Scheduling in an actual background, an evolvable real-time system of Integrated Satellite Scheduling is constructed based on Cooperative Neuro Evolution of Augmenting Topologies (C-NEAT). With the help of the C-NEAT, the system learns from historical scheduling data and adaptively assigns each request to the satellite or the ground antenna which is most likely to fulfill this request. Moreover, the real-time scheduling function of the system is actualized by the windowed scheduling framework. Experimental results indicate that the system greatly reduces the problem size of Integrated Satellite Scheduling and improves the scheduling efficiency, where daily and emergent requests are arranged over time.

Summary Scientific scheduling of limited resource plays an important role in the remote sensing data processing. The remote sensing data processing task scheduling is characterized as one novel comprehensive multi‐objective model. In this proposed model, the remote sensing data processing task scheduling problem is divided into task dispensation and task scheduling sub‐problem with hundreds of variables being considered in it. In order to effectively solve this problem, Bayes belief model is applied to generate the initial dispensation plan, and learnable ant colony optimization is proposed to solve task scheduling sub‐problem. Experimental results suggest that the proposed comprehensive multi‐objective model and its solving methods are feasible and efficient to remote sensing data processing task scheduling, and it also promotes processing centers interoperability among heterogeneous and dispersed processing center. The model and the method of this paper can provide a valuable reference for solving other complex scheduling problem.

Capacitated Arc Routing Problem (CARP) is one of the hot issues of logistics research. Specifically, Ranking First Cutting Second (RFCS) could be used. This research proposed a novel partitioning algorithm - the Multi-Label algorithm which obtained better TSP paths meeting the backpack limit on the basis of a complete TSP return. In addition, by experimental verification on questions in the standard question database, the experimental results showed that compared with general partitioning algorithms, for the same complete TSP return, many TSP paths with the shortest total length could be obtained by the Multi-Label algorithm.

The capacitated arc routing problem (CARP) is representative of numerous practical applications, and in order to widen its scope, we consider an extended version of this problem that entails both total service time and fixed investment costs. We subsequently propose a hybrid ant colony optimization (ACO) algorithm (HACOA) to solve instances of the extended CARP. This approach is characterized by the exploitation of heuristic information, adaptive parameters, and local optimization techniques: Two kinds of heuristic information, arc cluster information and arc priority information, are obtained continuously from the solutions sampled to guide the subsequent optimization process. The adaptive parameters ease the burden of choosing initial values and facilitate improved and more robust results. Finally, local optimization, based on the two-opt heuristic, is employed to improve the overall performance of the proposed algorithm. The resulting HACOA is tested on four sets of benchmark problems containing a total of 87 instances with up to 140 nodes and 380 arcs. In order to evaluate the effectiveness of the proposed method, some existing capacitated arc routing heuristics are extended to cope with the extended version of this problem; the experimental results indicate that the proposed ACO method outperforms these heuristics.

The capacitated arc routing problem (CARP) is a challenging vehicle routing problem with numerous real world applications. In this paper, an extended version of CARP, the multidepot capacitated arc routing problem (MCARP), is presented to tackle practical requirements. Existing CARP heuristics are extended to cope with MCARP and are integrated into a novel evolutionary framework: the initial population is constructed either by random generation, the extended random path-scanning heuristic, or the extended random Ulusoy's heuristic. Subsequently, multiple distinct operators are employed to perform selection, crossover, and mutation. Finally, the partial replacement procedure is implemented to maintain population diversity. The proposed evolutionary approach (EA) is primarily characterized by the exploitation of attributes found in near-optimal MCARP solutions that are obtained throughout the execution of the algorithm. Two techniques are employed toward this end: the performance information of an operator is applied to select from a range of operators for selection, crossover, and mutation. Furthermore, the arc assignment priority information is employed to determine promising positions along the genome for operations of crossover and mutation. The EA is evaluated on 107 instances with up to 140 nodes and 380 arcs. The experimental results suggest that the integrated evolutionary framework significantly outperforms these individual extended heuristics.