Search

Instant delivery is an intermediary bridge for same-city O2O services and an important part of urban short-distance logistics. The route planning and scheduling of instant delivery need to balance cost and customer satisfaction and consider the impact of traffic conditions on the distribution process. In this paper, we propose a vehicle routing problem model considering two types of customer time windows under time-dependent road networks and design a memetic algorithm combined with genetic algorithm and variable neighborhood search to solve the problem. By comparing the results of the different time periods and conducting sensitivity analysis for the two types of customer time windows, the effectiveness of the model and algorithm is verified. [ABSTRACT FROM AUTHOR]

For the large-scale search and rescue (S&R) scenarios, the centralized and distributed multi-UAV multitask assignment algorithms for multi-UAV systems have the problems of heavy computational load and massive communication burden, which make it hard to guarantee the effectiveness and convergence speed of their task assignment results. To address this issue, this paper proposes a hierarchical task assignment strategy. Firstly, a model decoupling algorithm based on density clustering and negotiation mechanism is raised to decompose the large-scale task assignment problem into several nonintersection and complete small-scale task assignment problems, which effectively reduces the required computational amount and communication cost. Then, a cluster head selection method based on multiattribute decision is put forward to select the cluster head for each UAV team. These cluster heads will communicate with the central control station about the latest assignment information to guarantee the completion of S&R mission. At last, considering that a few targets cannot be effectively allocated due to UAVs' limited and unbalanced resources, an auction-based task sharing scheme among UAV teams is presented to guarantee the mission coverage of the multi-UAV system. Simulation results and analyses comprehensively verify the feasibility and effectiveness of the proposed hierarchical task assignment strategy in large-scale S&R scenarios with dispersed clustering targets. [ABSTRACT FROM AUTHOR]

The identification of generating units that abuse market power is an essential part of risk prevention in a spot market, especially in the early stage of the construction of the spot market. In this study, a model for identifying generating units that abuse market power is designed based on the AdaBoost-DT algorithm. It is targeted at the imbalance between samples of generating units that abuse market power and normal generating units in the spot market. First, the four main methods by which market power is abused by generating units in the spot market are described: collusion, economic withholding, physical withholding, and extreme quotation. Second, the specific characteristics of the four methods are analyzed, and the identification indexes for generating units that abuse market power are established. Thereafter, a sample set of generating units that abuse market power using different methods is constructed. Furthermore, a training set is formed with samples of normal generating units to construct a model based on the AdaBoost-DT algorithm, for identifying generating units that abuse market power. Finally, the spot market data of a certain region are used for an example analysis. The results show that the accuracy of model identification is 97%, which validates the method. [ABSTRACT FROM AUTHOR]

Recently, it was demonstrated that multitasking evolutionary algorithm (MTEA), a newly proposed algorithm, can solve multiple optimization problems simultaneously through a single run, breaking through the limitations of traditional evolutionary algorithms (EAs), with good convergence and exploration performance. As a novel algorithm, MTEA still has a lot of unexplored space. Generally speaking, the order of solution variables has no significant influence on the single-tasking EAs. To our knowledge, the effect of the order of variables in the multitasking scenario has not been explored. To fill in this research gap, three orders of variables in the multitasking scenario are proposed in this paper, including full reverse order, bisection reverse order, and trisection reverse order. An important feature of these orders of variables is that an individual can recover as himself after two times of changing the order of variables. In order to verify our idea, these orders of variables are embedded into MTEA. The experiment results revealed that the effect of the different orders of variables is universal but not significant enough in the practical application. Furthermore, tasks with high similarity and high degree of intersection are sensitive to the order of variables and get great impact between tasks. [ABSTRACT FROM AUTHOR]

Multitasking evolutionary algorithm (MTEA), which solves multiple optimization tasks simultaneously in a single run, has received considerable attention in the community of evolutionary computation, and several algorithms have been proposed in the literature. Unfortunately, knowledge transfer between constituent tasks may cause negative effect on algorithm performance, especially when the optimal solutions of all tasks are in different locations of the unified search space. To address this issue, an effective variable transformation strategy and the corresponding inverse transformation are proposed in multitasking optimization scenario. After using variable transformation strategy, the estimated optimal solutions of all tasks are both near the center point of the unified search space. More importantly, this strategy can enhance the task similarity, and then the effectiveness of knowledge transfer will probably be positive in this case, which can help us to improve the algorithm performance. Keeping this in mind, a multitasking evolutionary algorithm (named MTDE-VT) is realized as an instance by embedding the proposed variable transformation strategy into multitasking differential evolution. In MTDE-VT, the individuals in the original population are first transformed into new locations by the variable transformation strategy. Once the offspring is generated in the transformed unified search space, it must be transformed back to the original unified search space. The statistical analysis of experimental results on some multitasking optimization benchmark problems illustrates the superiority of the proposed MTDE-VT algorithm in terms of solution accuracy and robustness. Furthermore, the basic principle and the good parameter combination are also provided based on massive simulated data. [ABSTRACT FROM AUTHOR]