Constrained Time-Critical Routing For Multiple Mobile Agents

In this paper, we introduce Time-Constrained Vehicle Routing Problem (TCVRP), a variation of the Vehicle Routing Problem (VRP) with time constraints. We formulate the problem as Integer Linear Programming with the two objectives: minimizing the number of agents used in routing, and minimizing the time spent in routing. We propose an efficient heuristic using a combination of A
^*
Search and Ruin and Recreate algorithms to solve TCVRP Finally, We conduct an experimental evaluation of the proposed heuristic and provide the performance results.