Flexible Capacitated Vehicle Routing Problem Solution Method Based on Memory Pointer Network

In real-world logistics scenarios, the complexities often surpass what traditional Capacitated Vehicle Routing Problem (CVRP) models can effectively address. For instance, when there is an excess of goods and limited vehicles, traditional CVRP models frequently fail to yield feasible solutions. Additionally, the time sensitivity of goods and the large scale of vehicles and goods in practical logistics scenarios present significant challenges for efficient problem-solving. This underscores the urgent need to develop a novel CVRP model that is better suited for logistics scenarios and enhances the scalability of CVRP. To address these limitations, we propose a flexible CVRP model, referred to as Flexible CVRP, which modifies the optimization objectives and constraints. This allows CVRP to provide a sensible solution even when no feasible solution exists in the traditional sense. To tackle the challenges posed by large-scale problems, we leverage the Memory Pointer Network (MemPtrN). This approach enables the modeling of solution strategies, offering strong generalization capabilities and mitigating the explosive growth in complexity to some extent. Compared to commonly used heuristic algorithms, our method achieves superior solution quality for large-scale problems. Specifically, when addressing large-scale scenarios, the MemPtrN outperforms Google’s OR-Tools solver, heuristic algorithms, enhanced evolutionary algorithms, and other reinforcement learning methods in terms of both solution speed and quality.