D3 A6 P3 A3 A5 P2 D1 P1 A1 A2 D4 A4 D2 Ski Lift Pickup Point Ski Run IntersectionSki Lift Drop Off...

download D3 A6 P3 A3 A5 P2 D1 P1 A1 A2 D4 A4 D2 Ski Lift Pickup Point Ski Run IntersectionSki Lift Drop Off Point.

If you can't read please download the document

  • date post

    22-Dec-2015
  • Category

    Documents

  • view

    216
  • download

    1

Embed Size (px)

Transcript of D3 A6 P3 A3 A5 P2 D1 P1 A1 A2 D4 A4 D2 Ski Lift Pickup Point Ski Run IntersectionSki Lift Drop Off...

  • Slide 1
  • Slide 2
  • Slide 3
  • Slide 4
  • D3 A6 P3 A3 A5 P2 D1 P1 A1 A2 D4 A4 D2
  • Slide 5
  • Ski Lift Pickup Point Ski Run IntersectionSki Lift Drop Off Point
  • Slide 6
  • Ski Lift Pickup Point Ski Run IntersectionSki Lift Drop Off Point Max Distance ij * Y ij
  • Slide 7
  • Slope Classification ij Skier Ability
  • Slide 8
  • Y ij * (Ski Time ij + Lift Time ij ) Allowable Time Ski Time = Distance * (60 / Skier Speed)
  • Slide 9
  • Max Distance ij * Y ij Y ij * (Ski Time ij + Lift Time ij ) Allowable Time Slope Classification ij Skier Ability Y ij Capacity ij Flow In = Flow Out
  • Slide 10
  • Attacks
  • Slide 11
  • Attack Mitigation
  • Slide 12
  • Operator / Attacker Paths that determine the best MOE calculated Attacks can only occur on the original path Operator must determine the best locations to mitigate the attacks
  • Slide 13
  • Ski Lift Pickup Point Ski Run IntersectionSki Lift Drop Off Point
  • Slide 14
  • Beginner Optimal Route 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5
  • Slide 15
  • Slide 16
  • 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 Intermediate Optimal Route
  • Slide 17
  • Slide 18
  • 1 2 23 3 3 4 4 4 4 5 5 5 5 5 Advanced Optimal Route
  • Slide 19
  • Slide 20
  • Analysis Summary Problem Scoped to Only Most-Used Paths Large Impact on MOE With Small Amount of Mitigating Equipment
  • Slide 21
  • Limitations Would Like Higher Granularity of Routes Mitigation of Attacks Are Done Manually Fixed Speed Values of Skier Limits Reality Add Recovery Time & Change Allowable Times
  • Slide 22
  • Slide 23
  • Primal Dual Dual Variables Max ( d(I,j) * Y(I,j) ) Min ( (ji,j)*cap(I,j) + Tot_Time*(i)) Y(I,j) Y(j,i) = 0 (j) (j) (i) + (I,j) + (i)*t(I,j) d(I,j) Y(I,j) cap(I,j) for all (I,j) (I,j) (I,j) 0 ( Y(I,j) * t(I,j) ) Tot_Time (i) (i) 0 Y(I,j) 0 is unrestricted