In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used t...In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.展开更多
针对现有入侵检测技术的不足,文章研究了基于机器学习的异常入侵检测系统,将多标记和半监督学习应用于入侵检测,提出了一种基于多标记学习的入侵检测算法。该算法采用"k近邻"分类准则,统计近邻样本的类别标记信息,通过最大化...针对现有入侵检测技术的不足,文章研究了基于机器学习的异常入侵检测系统,将多标记和半监督学习应用于入侵检测,提出了一种基于多标记学习的入侵检测算法。该算法采用"k近邻"分类准则,统计近邻样本的类别标记信息,通过最大化后验概率(maximum a posteriori,MAP)的方式推理未标记数据的所属集合。在KDD CUP99数据集上的仿真结果表明,该算法能有效地改善入侵检测系统的性能。展开更多
This paper proposes a new cost-efficient,adaptive,and self-healing algorithm in real time that detects faults in a short period with high accuracy,even in the situations when it is difficult to detect.Rather than usin...This paper proposes a new cost-efficient,adaptive,and self-healing algorithm in real time that detects faults in a short period with high accuracy,even in the situations when it is difficult to detect.Rather than using traditional machine learning(ML)algorithms or hybrid signal processing techniques,a new framework based on an optimization enabled weighted ensemble method is developed that combines essential ML algorithms.In the proposed method,the system will select and compound appropriate ML algorithms based on Particle Swarm Optimization(PSO)weights.For this purpose,power system failures are simulated by using the PSCA D-Python co-simulation.One of the salient features of this study is that the proposed solution works on real-time raw data without using any pre-computational techniques or pre-stored information.Therefore,the proposed technique will be able to work on different systems,topologies,or data collections.The proposed fault detection technique is validated by using PSCAD-Python co-simulation on a modified and standard IEEE-14 and standard IEEE-39 bus considering network faults which are difficult to detect.展开更多
基金supported by the National Science Fund for Distinguished Young Scholars of China(61525304)the National Natural Science Foundation of China(61873328)
文摘In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.
文摘针对现有入侵检测技术的不足,文章研究了基于机器学习的异常入侵检测系统,将多标记和半监督学习应用于入侵检测,提出了一种基于多标记学习的入侵检测算法。该算法采用"k近邻"分类准则,统计近邻样本的类别标记信息,通过最大化后验概率(maximum a posteriori,MAP)的方式推理未标记数据的所属集合。在KDD CUP99数据集上的仿真结果表明,该算法能有效地改善入侵检测系统的性能。
文摘This paper proposes a new cost-efficient,adaptive,and self-healing algorithm in real time that detects faults in a short period with high accuracy,even in the situations when it is difficult to detect.Rather than using traditional machine learning(ML)algorithms or hybrid signal processing techniques,a new framework based on an optimization enabled weighted ensemble method is developed that combines essential ML algorithms.In the proposed method,the system will select and compound appropriate ML algorithms based on Particle Swarm Optimization(PSO)weights.For this purpose,power system failures are simulated by using the PSCA D-Python co-simulation.One of the salient features of this study is that the proposed solution works on real-time raw data without using any pre-computational techniques or pre-stored information.Therefore,the proposed technique will be able to work on different systems,topologies,or data collections.The proposed fault detection technique is validated by using PSCAD-Python co-simulation on a modified and standard IEEE-14 and standard IEEE-39 bus considering network faults which are difficult to detect.
