IACS Computational Challenge!

Contact info• Pavlos Protopapas pprotopapas@cfa.harvard.edu TEAM LEAD B

• Mauricio Santillana msantill@fas.harvard.edu TEAM LEAD A

• Ozlem Ergun oergun@isye.gatech.edu PROBLEM COORDINATOR

• Rosalind Reid rreid@seas.harvard.edu CHALLENGE COORDINATOR

• Robert Parrott parrott@seas.harvard.edu achelp@seas.harvard.edu COMPUTATIONAL

• Natasha Baker nrbaker@seas.harvard.edu EVERYTHING ELSE

Dates• Tuesday the 10th at 10:00am kickoff meeting.

Introductions.Setting up computer accounts etcGetting the data. Explain the rules.

• Friday the 13th at 3:30pm. Preliminary 20 minutes presentation to IACS advisory board.

• Thursday 19th at 1:30m dry run.

• Friday 20th 9:00am final submission of the code and schedule.

– Time limit on running will be 3 hours. If code crashes, teams will have to complete in those 3 hours.

• Friday the 20th at 3:45pm final presentation (S. Wolfram and others will be present)

PRICES

• iPADS for the winners• Certificates for all • IACS log FLASH drives for the loosing team.

METRIC

• The objective is the sum of unmet demand after every period.

• In case of a tie, best presentation wins

Computational resources.

• Each team will be given access to 3 computing nodes with GPGPU.

TEAMS• TEAM A: Mauricio Santillana

• Qin Yu

• Ariana Minot

• Yifan Wu

• TEAM B: Pavlos Protopapas

• Chris Beaumont

• Ye Zhao

• Blessing Okeke

Budget

• $100 per team for pizza

Problem Statement• Attached are two excel files. Each has a list of nodes, each with supply or demand and coordinates. All

supply and demand is present immediately and can be used with no limit in any period. There is also a list of undirected edges, with a weight corresponding to how many resources are required to open that edge. The last column is how much resources each period has to clear debris.

• The objective is the sum of unmet demand after every period.• The constraint is you can start opening arcs in a connected manner from any node with supply, although it

might be easier to say edges can be opened arbitrarily.

Problem Statement• gridSample:• 10x10 grid with one source node, all arcs cost 1 to open. Should be pretty ismple to get a good solution.

We have near optimal solutions to this.

• cambridge:

• Two source nodes, one is big and can service the entire network itself, and one is small but can only service part of the network alone. I was going to put capacities on how much each can do a period, but this has already taken a long time to get set up. The data for debris, demand, and supply come from Melih, I had to create how much resources we had to clear debris each period and balance the supply/demand numbers since they aren't scaled.

• Two things of note. First, the resources available to clear debris increase every three periods. The debris can be cleared in 8 periods easy enough, and the model indicates 9 available. Second, Melih provided codes indicating primary vs secondary roads. The assumption I made on the primary roads is that they are wider and should be easier to clear a path, so multiplied the given cost to open primary road arcs by a random number between 0 and 1.

Problem Statement• gridSample:

10x10 grid with one source node, all arcs cost 1 to open. Should be pretty ismple to get a good solution. We have near optimal solutions to this.

• cambridge:

Two source nodes, one is big and can service the entire network itself, and one is small but can only service part of the network alone. I was going to put capacities on how much each can do a period, but this has already taken a long time to get set up. The data for debris, demand, and supply come from Melih, I had to create how much resources we had to clear debris each period and balance the supply/demand numbers since they aren't scaled.

Two things of note. First, the resources available to clear debris increase every three periods. The debris can be cleared in 8 periods easy enough, and the model indicates 9 available. Second, Melih provided codes indicating primary vs secondary roads. The assumption I made on the primary roads is that they are wider and should be easier to clear a path, so multiplied the given cost to open primary road arcs by a random number between 0 and 1.