Adaptive Evolutionary Multitasking with Pyramid Matching Kernel Strategy for Solving the Green Two-Echelon Vehicle Routing Problem
摘要
The Green Two-Level Vehicle Routing Problem (G2E-VRP) is an extension of the VRP and is an NP-hard problem. Traditional approaches use independent single-task paradigms without considering task similarity. To address this, an Adaptive Evolutionary Multi-Task (AEMT-PMKS) algorithm based on the Pyramid Matching Kernel Strategy (PMKS) is proposed. First, the two-level transportation network of the G2E-VRP is clustered to construct a multi-task framework. A memetic algorithm is used to handle each task, and the Pyramid Matching Kernel Strategy is introduced to enable resource sharing among similar tasks. During the evolutionary process, short paths are detected, and the relationship between users and satellites is dynamically adjusted to obtain the global optimal solution. The widely used 2E-VRP benchmark instances are adopted, the effectiveness of the AEMT-PMKS algorithm is verified.