The vehicle routing problem (VRP) is a typical discrete combinatorial optimization problem,
and many models and algorithms have been proposed to solve the VRP and its variants …

An efficient manufacturing system is key to maintaining a healthy economy today. With the
rapid development of science and technology and the progress of human society, the …

Abstract Neural network-based Combinatorial Optimization (CO) methods have shown
promising results in solving various NP-complete (NPC) problems without relying on hand …

Neural combinatorial optimization (NCO) is a promising learning-based approach for solving
challenging combinatorial optimization problems without specialized algorithm design by …

In neural combinatorial optimization (CO), reinforcement learning (RL) can turn a deep
neural net into a fast, powerful heuristic solver of NP-hard problems. This approach has a …

Learning heuristics for vehicle routing problems (VRPs) has gained much attention due to
the less reliance on hand-crafted rules. However, existing methods are typically trained and …

Recently, Transformer has become a prevailing deep architecture for solving vehicle routing
problems (VRPs). However, it is less effective in learning improvement models for VRP …

Recently, deep reinforcement learning (DRL) models have shown promising results in
solving NP-hard Combinatorial Optimization (CO) problems. However, most DRL solvers …

Abstract Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been
successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally …

Recently, deep reinforcement learning (DRL) frameworks have shown potential for solving
NP-hard routing problems such as the traveling salesman problem (TSP) without problem …