Friday, October 11, 2019 1:30 pm
-
1:30 pm
EDT (GMT -04:00)
Mirmojtaba
Gharibi,
PhD
candidate
David
R.
Cheriton
School
of
Computer
Science
With the upcoming integration of drones in the airspace, it is of great importance to schedule drones to achieve efficiency and avoid collisions. Vehicle scheduling problem (VSP) is a new problem we defined to formulate this problem.
We show NP hardness for various objective functions as well as give a heuristic algorithm for solving the problem. We compare the results to the exact solution to the MIP formulation of the problem for small cases.