CVRP
A classic combinatorial optimization problem in operations research. It requires planning delivery routes for a fleet of vehicles serving a set of customer locations with demands, minimizing total travel cost while satisfying vehicle capacity constraints.
Timeline (last 90 days)
The drone delivery route planning problem can be modeled as a capacitated vehicle routing problem (CVRP), where the capacity corresponds to the drone's payload limit.
Using CVRP as a controlled proxy, the research team systematically identified three factors behind cross-scale generalization degradation: node density shift, attention diffusion, and dilution of graph context by mean pooling.
RELAGRAM (Recursive Latent Graph Model) is the first to introduce latent recursion into the field of graph combinatorial optimization, specifically targeting the capacitated vehicle routing problem (CVRP).
All Facts (3)
The drone delivery route planning problem can be modeled as a capacitated vehicle routing problem (CVRP), where the capacity corresponds to the drone's payload limit.
50%UnverifiedUsing CVRP as a controlled proxy, the research team systematically identified three factors behind cross-scale generalization degradation: node density shift, attention diffusion, and dilution of graph context by mean pooling.
50%UnverifiedRELAGRAM (Recursive Latent Graph Model) is the first to introduce latent recursion into the field of graph combinatorial optimization, specifically targeting the capacitated vehicle routing problem (CVRP).
50%