Airplanes 12/05

Group 1:
   
    Yang: The only thing we did was to top sort the planes like a tree. The planes are a leaf and their parent is the time of the flight it is dependent on. We are using this to order the plane’s takeoff.
    Vishwa <absent>
    Hari

Group 2:

    Harjot <absent>
    Tieram: Given that we cannot go through and simulate everything, the chain of dependencies are a good heuristic
    Sam: The main thing that we still need to fix is preferring planes that have other dependencies. We take everything off as soon as possible. When a plane gets into a hub with a lot of planes we do not prioritize the planes that have dependencies. The flight with the longest chain of dependencies.

Group 3


    Marcus
    Hao
    Franklin

Group 4

    Tanay
    Yigit:
    Tim: We assign a total time to every flight which is the cumulative sum of that flight’s departure time, the distance of the flight, and the longest total time of all its dependency. Build up a stock of dependencies. We prioritize those by sending them first to the flight route generator. It is hard to look at the board and seeing how to optimize the strategy like you could with the standard game.

Group 5

    Tanveer <absent>
    Lauren: We continued to look at different priority algorithms. We sort off of the departure plane and flight path with dependencies.
    Jinesh: the one plane is making a semi circle because we decided that it was better to take off then to delay.

Group 6
    Di <excused absence>
    Patrick: we make a hash set of when the planes arrive. If the plane has no dependencies, then we take them off list. We launch the plane that will arrive later.