|
|
|
|
|
|
Asymmetric Close-Enough Vehicle Routing Problem
Lettiery D'Lamare Portela Procópio, M.Sc. in Systems and Computing
The need to create routes for vehicles to execute specific demands, suits according to
the purpose of the application.
With the popularization of unmanned aerial vehicles (UAVs), a new scenario arises that
requires the routing of one or more vehicles to achieve a common objective, to fulfill
demand (photos, videos, data collection or delivery, and even object recognition).
The UAVs must reach a certain distance from the center of the target. Also, the restricted
displacement capacity of these vehicles must be considered, as well as the interference of
the winds in the trajectory of the UAVs. These restrictions are handled by the Asymmetric
Close-Enough Vehicle Routing Problem (ACVRP), which seeks to establish minimum routes for
vehicles perform the next demand enough of the desired target.
To improve the algorithm comparison methodology proposed for A-CEVRP, a set of data instances required for the problem was adapted and made available below.
Click here to back to the previous page.
