Jul 2026
Reward-Density Heuristic for Dynamic Multi-Vehicle Routing: Performance and Computational Efficiency
In dynamic, time-constrained routing environments, carefully designed greedy heuristics can match the output of sophisticated search procedures at a fraction of the computational cost, making them preferable for online deployment.
Manish Kolachalam, Rani Malhotra
· arXiv.org · 0 citations