Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price
arXiv:2603.21880v2 Announce Type: replace
Abstract: The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one or more time windows…