4.6 Article

Composite Particle Swarm Optimizer With Historical Memory for Function Optimization

期刊

IEEE TRANSACTIONS ON CYBERNETICS
卷 45, 期 10, 页码 2350-2363

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2015.2424836

关键词

Estimation of distribution algorithm (EDA); historical memory; particle swarm optimization (PSO)

资金

  1. National Natural Science Foundation of China [61272271, 61332008, 91218301]
  2. NSF of USA [CMMI-1162482]
  3. National Basic Research Program of China (973 Program) [2014CB340404]
  4. Natural Science Foundation Program of Shanghai [12ZR1434000]
  5. International Cooperation Project of Chinese Ministry of Science and Technology [2012DFG11580]
  6. Div Of Civil, Mechanical, & Manufact Inn
  7. Directorate For Engineering [1162482] Funding Source: National Science Foundation

向作者/读者索取更多资源

Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memorybased PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Theory & Methods

Scheduling of Resource Allocation Systems with Timed Petri Nets: A Survey

Bo Huang, Mengchu Zhou, Xiaoyu Sean Lu, Abdullah Abusorrah

Summary: Resource allocation systems (RASs) are commonly used discrete event systems in the industry, where available resources are allocated to optimize performance criteria. This paper provides a tutorial and comprehensive literature survey on RG-based RSP methods, presenting a framework for RSPs and their PNs, construction methods, scheduling objectives, search strategies, heuristic functions, and future research directions.

ACM COMPUTING SURVEYS (2023)

Article Computer Science, Artificial Intelligence

Application of machine learning methods in fault detection and classification of power transmission lines: a survey

Fatemeh Mohammadi Shakiba, S. Mohsen Azizi, Mengchu Zhou, Abdullah Abusorrah

Summary: This paper surveys recent machine learning-based techniques for fault detection, classification, and location estimation in transmission lines. It emphasizes the need for faster and more accurate fault identification tools and introduces various machine learning methodologies and artificial neural networks used in diagnosing transmission line faults.

ARTIFICIAL INTELLIGENCE REVIEW (2023)

Article Engineering, Electrical & Electronic

Semi-Direct Multimap SLAM System for Real-Time Sparse 3-D Map Reconstruction

Hongyu Xie, Dong Zhang, Jun Wang, MengChu Zhou, Zhengcai Cao, Xiaobo Hu, Abdullah Abusorrah

Summary: This research proposes a semidirect multimap monocular SLAM system (SM-SLAM) that combines direct tracking and feature-based map maintenance with point features and line segments. The experimental results show that SM-SLAM can accurately reconstruct a sparse 3D map with geometrical structure information in low-textured environments at a speed of 30-40 Hz.

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT (2023)

Article Automation & Control Systems

A Refined Siphon-Based Deadlock Prevention Policy for a Class of Petri Nets

ShouGuang Wang, Xin Guo, Oussama Karoui, MengChu Zhou, Dan You, Abdullah Abusorrah

Summary: This study focuses on the deadlock control problem in resource allocation systems using mixed-integer programming and iterative siphon control. It proposes a two-stage deadlock prevention policy, which avoids exhaustive enumeration and reachability analysis.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Automation & Control Systems

Discriminative Manifold Distribution Alignment for Domain Adaptation

SiYa Yao, Qi Kang, MengChu Zhou, Muhyaddin J. Rawa, Aiiad Albeshri

Summary: This article proposes an efficient discriminative manifold distribution alignment (DMDA) approach, which improves feature transferability by aligning both global and local distributions and refines a discriminative model by learning geometrical structures in manifold space. Extensive experiments show that DMDA outperforms other methods in both classification accuracy and time efficiency in domain adaptation tasks.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Chemistry, Multidisciplinary

A Knowledge Sharing and Individually Guided Evolutionary Algorithm for Multi-Task Optimization Problems

Xiaoling Wang, Qi Kang, Mengchu Zhou, Zheng Fan, Aiiad Albeshri

Summary: Multi-task optimization (MTO) is a new evolutionary computation paradigm that solves multiple optimization tasks concurrently by utilizing task similarities and historical knowledge. This work proposes the individually guided multi-task optimization (IMTO) framework, which explores each individual to learn from other tasks, selects individuals with higher solving ability, and only inferior individuals learn from other tasks to improve knowledge transfer. The advantage of IMTO over multifactorial evolutionary framework and baseline solvers is verified through benchmark studies.

APPLIED SCIENCES-BASEL (2023)

Article Computer Science, Information Systems

Self-paced multi-label co-training

Yanlu Gong, Quanwang Wu, Mengchu Zhou, Junhao Wen

Summary: Multi-label learning aims to solve classification problems where instances are associated with a set of labels. This work proposes a novel approach called Self-paced Multi-label Co-Training (SMCT) that leverages the co-training paradigm to train two classifiers iteratively and communicate predictions on unlabeled data. Experimental evaluations demonstrate the competitive performance of SMCT compared to state-of-the-art methods.

INFORMATION SCIENCES (2023)

Article Computer Science, Artificial Intelligence

Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning

Zizhen Zhang, Hong Liu, MengChu Zhou, Jiahai Wang

Summary: This article introduces the traveling salesman problem (TSP) and its dynamic versions (DTSP and DPDP). By improving the attention model, a deep reinforcement learning algorithm is proposed to solve DTSP and DPDP problems. Experimental results show that this method can capture dynamic changes and produce satisfactory solutions in a short time, with over 5% improvements observed in many cases compared to other baseline approaches.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Fully Complex-valued Dendritic Neuron Model

Shangce Gao, MengChu Zhou, Ziqian Wang, Daiki Sugiyama, Jiujun Cheng, Jiahai Wang, Yuki Todo

Summary: This article introduces a single dendritic neuron model (DNM) with nonlinear information processing ability, which is extended to complex-valued domain. Experimental results demonstrate that this complex-valued DNM significantly outperforms real-valued DNM, complex-valued multi-layer perceptron, and other complex-valued neuron models.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Automation & Control Systems

A Dynamic Evolution Method for Autonomous Vehicle Groups in an Urban Scene

Guiyuan Yuan, Jiujun Cheng, MengChu Zhou, Sheng Cheng, Shangce Gao, Changjun Jiang, Abdullah Abusorrah

Summary: Accurately processing dynamic evolution events is extremely challenging for autonomous vehicle groups in an urban scene, as they are affected by manned vehicles, roadside obstacles, traffic lights, and pedestrians. Existing work in this area has focused on highway scenes and cannot be directly applied to urban scenes due to different environmental factors and incomplete dynamic evolution events. In this study, a dynamic evolution method specifically designed for autonomous vehicle groups in urban scenes is proposed, which analyzes the reasons for dynamic evolution, abstracts five dynamic evolution events, and introduces a method to process them. Simulation results demonstrate that the proposed method outperforms the existing highway scene method in terms of connectivity, coupling, timeliness, and evolvability of vehicle groups.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Automation & Control Systems

Multirobot Cooperative Patrolling Strategy for Moving Objects

Li Huang, MengChu Zhou, Kuangrong Hao, Hua Han

Summary: This paper proposes a distributed event-driven cooperative strategy for multirobot systems to autonomously patrol moving objects. It defines forward and backward utility functions as evaluation criteria for robots to choose patrol targets, and proposes three event types and a cooperative action considering energy consumption and visiting frequency to improve coordination among robots in their execution processes. Simulation experiments show that the proposed strategy has significant advantages in decreasing the average and maximum unvisited time of moving objects compared to the state-of-the-art. A marine pollution monitoring case is simulated to demonstrate the practicability of this strategy.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Automation & Control Systems

Adaptive Particle Swarm Optimizer Combining Hierarchical Learning With Variable Population

Huan Liu, Junqi Zhang, MengChu Zhou

Summary: This paper proposes an adaptive particle swarm optimizer that combines hierarchical learning with variable population to enhance the performance of the PSO algorithm. By introducing a heap-based hierarchy and adjusting the particle's level based on its current fitness, as well as eliminating redundant particles based on the population's evolution state, the swarm's exploratory and exploitative capabilities are improved.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Computer Science, Cybernetics

Time-Aware Attention-Based Gated Network for Credit Card Fraud Detection by Extracting Transactional Behaviors

Yu Xie, Guanjun Liu, Chungang Yan, Changjun Jiang, MengChu Zhou

Summary: This study proposes a new model to extract transactional behaviors of credit card users and learn new transactional behavioral representations for fraud detection. The model utilizes time-aware gates and an attention module to capture long- and short-term transactional habits of users and extract behavioral motive and periodicity from historical transactions.

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Learning Smooth Representation for Unsupervised Domain Adaptation

Guanyu Cai, Lianghua He, MengChu Zhou, Hesham Alhumade, Die Hu

Summary: This article explores the performance of adversarial-training-based unsupervised domain adaptation (UDA) methods with Lipschitz constraints when dealing with complex source and target datasets with large distribution discrepancies. The connection between Lipschitz constraints and the error bound of UDA is analyzed, demonstrating how Lipschitzness reduces the error bound. Experimental results show that considering the sample amount of the target domain, dimension, and batch size is crucial for the effectiveness and stability of UDA. The model performs well on standard benchmarks.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Automation & Control Systems

Learning-Based Cuckoo Search Algorithm to Schedule a Flexible Job Shop With Sequencing Flexibility

ChengRan Lin, ZhengCai Cao, MengChu Zhou

Summary: This study addresses the extended version of the flexible job-shop problem and proposes a learning-based cuckoo search algorithm to obtain reliable and high-quality schedules. By introducing a sparse autoencoder and a factorization machine, the algorithm achieves promising results. Numerical simulations show that it outperforms traditional methods.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

暂无数据