4.6 Article

Explicit Evolutionary Multitasking for Combinatorial Optimization: A Case Study on Capacitated Vehicle Routing Problem

期刊

IEEE TRANSACTIONS ON CYBERNETICS
卷 51, 期 6, 页码 3143-3156

出版社

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

关键词

Evolutionary optimization; knowledge transfer; multitask optimization; routing problem

资金

  1. National Natural Science Foundation of China [61876025, 61602181]
  2. Venture and Innovation Support Program for Chongqing Overseas Returnees [cx2018044, cx2019020]
  3. City University of Hong Kong Research Fund [9610397]
  4. Research Grants Council of the Hong Kong Special Administrative Region, China [CityU11202418, CityU11209219]
  5. Shenzhen Scientific Research and Development Funding Program [JCYJ20180307123637294]
  6. Scientific and Technological Innovation Foundation of Chongqing [cstc2019yszx-jscxX0001]
  7. Fundamental Research Funds for the Central Universities [D2191200]

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

This article introduces the concept of Evolutionary Multitasking (EMT), discusses the limitations of autoencoding-based EMT algorithm and explores the application of explicit EMT in combinatorial optimization problems. A new algorithm is proposed for solving the vehicle routing problem, and its effectiveness is validated through empirical studies.
Recently, evolutionary multitasking (EMT) has been proposed in the field of evolutionary computation as a new search paradigm, for solving multiple optimization tasks simultaneously. By sharing useful traits found along the evolutionary search process across different optimization tasks, the optimization performance on each task could be enhanced. The autoencoding-based EMT is a recently proposed EMT algorithm. In contrast to most existing EMT algorithms, which conduct knowledge transfer across tasks implicitly via crossover, it intends to perform knowledge transfer explicitly among tasks in the form of task solutions, which enables the employment of task-specific search mechanisms for different optimization tasks in EMT. However, the autoencoding-based explicit EMT can only work on continuous optimization problems. It will fail on combinatorial optimization problems, which widely exist in real-world applications, such as scheduling problem, routing problem, and assignment problem. To the best of our knowledge, there is no existing effort working on explicit EMT for combinatorial optimization problems. Taking this cue, in this article, we thus embark on a study toward explicit EMT for combinatorial optimization. In particular, by using vehicle routing as an illustrative combinatorial optimization problem, the proposed explicit EMT algorithm (EEMTA) mainly contains a weighted l(1)-normregularized learning process for capturing the transfer mapping, and a solution-based knowledge transfer process across vehicle routing problems (VRPs). To evaluate the efficacy of the proposed EEMTA, comprehensive empirical studies have been conducted with the commonly used vehicle routing benchmarks in multitasking environment, against both the state-of-the-art EMT algorithm and the traditional single-task evolutionary solvers. Finally, a real-world combinatorial optimization application, that is, the package delivery problem (PDP), is also presented to further confirm the efficacy of the proposed algorithm.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

Article Computer Science, Artificial Intelligence

HAS-EA: a fast parallel surrogate-assisted evolutionary algorithm

Yixian Li, Jinghui Zhong

Summary: The study proposes an efficient heterogeneous asynchronous parallel surrogate-assisted evolutionary algorithm (HAS-EA) that improves the search performance of expensive optimization problems. By performing operations in parallel on both CPU and GPU, the algorithm accelerates the search performance.

MEMETIC COMPUTING (2023)

Article Computer Science, Artificial Intelligence

Distributed and Expensive Evolutionary Constrained Optimization With On-Demand Evaluation

Feng-Feng Wei, Wei-Neng Chen, Qing Li, Sang-Woon Jeon, Jun Zhang

Summary: This article defines distributed expensive constrained optimization problems (DECOPs) and proposes a distributed evolutionary constrained optimization algorithm with on-demand evaluation (DEAOE). DEAOE adaptively evolves different constraints in an asynchronous way through on-demand evaluation, improving population convergence and diversity. Experimental results demonstrate that DEAOE outperforms centralized state-of-the-art surrogate-assisted evolutionary algorithms (SAEAs) in terms of performance and efficiency.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2023)

Article Engineering, Civil

Travel Time Distribution Estimation by Learning Representations Over Temporal Attributed Graphs

Wanyi Zhou, Xiaolin Xiao, Yue-Jiao Gong, Jia Chen, Jun Fang, Naiqiang Tan, Nan Ma, Qun Li, Chai Hua, Sang-Woon Jeon, Jun Zhang

Summary: This study proposes a method of formulating the traffic network as a temporal attributed graph and performing node representation learning on it to address the problem of travel time estimation. The learned representation can jointly exploit dynamic traffic conditions and the topology of the road network, and estimate travel time using a route-based spatio-temporal dependence learning module.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2023)

Article Engineering, Civil

MTrajPlanner: A Multiple-Trajectory Planning Algorithm for Autonomous Underwater Vehicles

Yue-Jiao Gong, Ting Huang, Yi-Ning Ma, Sang-Woon Jeon, Jun Zhang

Summary: This paper focuses on the multiple-trajectory planning problem for automatic underwater vehicles (AUVs) and proposes a comprehensive model that considers the complexity of underwater environments, efficiency of each trajectory, and diversity among different trajectories. To solve this problem, an ant colony-based trajectory optimizer is developed, incorporating a niching strategy, decayed alarm pheromone measure, and diversified heuristic measure for improved search effectiveness and efficiency. Experimental results demonstrate that the proposed algorithm not only provides multiple AUV trajectories for flexible choice, but also outperforms state-of-the-art algorithms in terms of single trajectory efficiency.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2023)

Article Automation & Control Systems

Optimizing Niche Center for Multimodal Optimization Problems

Yi Jiang, Zhi-Hui Zhan, Kay Chen Tan, Jun Zhang

Summary: This article introduces a differential evolution algorithm based on niche center distinguish (NCD) for multimodal optimization problems. The algorithm uses a genetic algorithm to online solve the NCD problem and proposes a niching and global cooperative mutation strategy that combines niche and population information. Experimental results show that the proposed algorithm performs well in solving multimodal optimization problems.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

A Surrogate-Assisted Differential Evolution Algorithm for High-Dimensional Expensive Optimization Problems

Weizhong Wang, Hai-Lin Liu, Kay Chen Tan

Summary: This article proposes a global and local surrogate-assisted differential evolution algorithm (GL-SADE) that utilizes a global RBF model to estimate global trend and accelerate convergence, as well as a local Kriging model to prevent local optima and further exploit the model through a reward search strategy. The algorithm is validated and demonstrated on benchmark functions of varying dimensions and an airfoil optimization problem.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Computer Science, Artificial Intelligence

Proximity ranking-based multimodal differential evolution

Junna Zhang, Degang Chen, Qiang Yang, Yiqiao Wang, Dong Liu, Sang-Woon Jeon, Jun Zhang

Summary: This paper proposes a novel differential evolution framework called proximity ranking-based multimodal differential evolution (PRMDE) for multimodal optimization. Through the cooperative cooperation among three main mechanisms, PRMDE is capable of locating multiple global optima simultaneously. Experimental results show that PRMDE is effective and achieves competitive or even better optimization performance than several representative methods.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

Function value ranking aware differential evolution for global numerical optimization

Dong Liu, Hao He, Qiang Yang, Yiqiao Wang, Sang-Woon Jeon, Jun Zhang

Summary: This paper proposes a simple and effective mutation scheme named DE/current-to-rwrand/1 to enhance the optimization ability of differential evolution (DE) in solving complex optimization problems. The proposed mutation strategy, called function value ranking aware differential evolution (FVRADE), balances high diversity and fast convergence of the population. Experimental results demonstrate that FVRADE outperforms several state-of-the-art methods and shows promise in solving real-world optimization problems.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

A random elite ensemble learning swarm optimizer for high-dimensional optimization

Qiang Yang, Gong-Wei Song, Xu-Dong Gao, Zhen-Yu Lu, Sang-Woon Jeon, Jun Zhang

Summary: High-dimensional optimization problems are becoming increasingly difficult due to interacting variables. This paper presents a random elite ensemble learning swarm optimizer (REELSO) inspired by human observational learning theory to effectively tackle such problems. REELSO partitions the swarm into elite and non-elite groups, allowing non-elite particles to observe and learn from elite particles, promoting convergence and maintaining swarm diversity. Experimental results demonstrate that REELSO performs competitively or even outperforms state-of-the-art approaches for high-dimensional optimization.

COMPLEX & INTELLIGENT SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

An Efficient Federated Genetic Programming Framework for Symbolic Regression

Junlan Dong, Jinghui Zhong, Wei-Neng Chen, Jun Zhang

Summary: This paper introduces a federated genetic programming framework that can train a global model while protecting data privacy. By processing decentralized data locally without sending the original data to the server, it achieves data privacy protection and reduces data collection time.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

Deep Reinforcement Learning Based Adaptive Operator Selection for Evolutionary Multi-Objective Optimization

Ye Tian, Xiaopeng Li, Haiping Ma, Xingyi Zhang, Kay Chen Tan, Yaochu Jin

Summary: This paper proposes a novel operator selection method based on reinforcement learning, which uses deep neural networks to learn a policy that determines the best operator for each parent, addressing the exploration-exploitation dilemma in operator selection.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Automation & Control Systems

An Efficient Two-Stage Surrogate-Assisted Differential Evolution for Expensive Inequality Constrained Optimization

Feng-Feng Wei, Wei-Neng Chen, Wentao Mao, Xiao-Min Hu, Jun Zhang

Summary: This article proposes an efficient two-stage surrogate-assisted differential evolution (eToSA-DE) algorithm to handle expensive inequality constraints. The algorithm trains a surrogate model for the degree of constraint violation, with the type of surrogate changing during the evolution process. Both types of surrogates are constructed using individuals selected by the boundary training data selection strategy. A feasible exploration strategy is devised to search for promising areas. Extensive experiments demonstrate that the proposed method can achieve satisfactory optimization results and significantly improve the efficiency of the algorithm.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Automation & Control Systems

Cooperative Differential Evolution With an Attention-Based Prediction Strategy for Dynamic Multiobjective Optimization

Xiao-Fang Liu, Jun Zhang, Jun Wang

Summary: This article presents a cooperative differential evolution algorithm with an attention-based prediction strategy for dynamic multiobjective optimization. Multiple populations are used to optimize multiple objectives and find subparts of the Pareto front. The algorithm achieves a balanced approximation of the Pareto front and adapts to changes in the environment by using a new attention-based prediction strategy. Experimental results demonstrate the superiority of the proposed method to state-of-the-art algorithms.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Engineering, Electrical & Electronic

Principled Design of Translation, Scale, and Rotation Invariant Variation Operators for Metaheuristics

Ye Tian, Xingyi Zhang, Cheng He, Kay Chen Tan, Yaochu Jin

Summary: A large number of metaheuristics have been proposed and shown high performance in solving complex optimization problems. While most variation operators in existing metaheuristics are empirically designed, new operators are automatically designed in this work, which are expected to be search space independent and thus exhibit robust performance on different problems.

CHINESE JOURNAL OF ELECTRONICS (2023)

Article Computer Science, Artificial Intelligence

Improving Multispike Learning With Plastic Synaptic Delays

Qiang Yu, Jialu Gao, Jianguo Wei, Jing Li, Kay Chen Tan, Tiejun Huang

Summary: This article proposes a new joint weight-delay plasticity rule, TDP-DL, for improving the learning performance of spiking neural networks (SNNs). By integrating plastic delays into the learning framework, the performance of multispike learning is significantly enhanced. Simulation results demonstrate the effectiveness and efficiency of the TDP-DL rule compared to baseline ones.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

暂无数据