SAN DIEGO VISITOA4202

10 June 2013

Lee EubanksJoseph A. Snel

Intro/Backstory Problem Assumptions Graph Elements Questions Formulation Results Relativity Follow-Up

Outline

One Day Vacation to San Diego

Maximize events/restaurant visited within 960 min

The sites are within the specific San Diego location Include events/restaurants that are possible

locations we want to see There are 2 sites and 1 restaurant we have to

visit

Intro/Backstory

Need to create a Networks model

maximizing number of nodes within 960 minutes (16 hrs) A shortest path problem with interdiction

Take the shortest path from each node to reduce time spent driving

Hotel will be the Start/End Node There are a few locations we must visit

Problem

All activities must be completed in 960 minutes Because San Diego is a heavy populated area, there

are numerous routes the nodes selected, however, these routes (edges) would only significantly increase travel time, therefore ignore these routes as if they did not exist.

Traffic times are constant throughout the day Interdictions in our case will be caused by Road

Construction closing the roads, or Traffic Jams significantly increasing the cost (time) on the edge.

Must-Go-Sites seen not in consecutive order

Assumptions

Nodes

1 Navy Lodge (S) 11 Greek Islands Café

2 SeaWorld 12 Pier Café

3 Hotel del Coronado 13 Specialty's Café & Bakery

4 San Diego Zoo 14 The Field Pub

5 Mission Bay Park 15 The Prado Rest. At Balboa Park

6 USS Midway Museum 16 The Grill at Torrey Pines

7 Naval Base San Diego 17 Bandar Restaurant

8 Miramar 18 SWP, pearl street

9 County Fair, Del Mar 19 Navy Lodge (T)

10 El Cajon Dinner & Concerts

Graph

Graph

Are established ground LOC’s

Can be attacked CVS file defines all possible edges

Each event has edge to all other possible events/restaurants

Each restaurant has an edge to all other events only

Edges

Had problems initially

Program was ending well before 960 min Sea World trip takes up 240 min by itself

Needed to account for time spent at nodes Split each node into Start – End nodes Can attack edge between Intra-Node

Intra-Node

Sample Path

SEES

S

E

How many nodes can we visit within certain

time frame before the program takes us back to the hotel?

How long does it take to transit the route predicted by the model?

What impact interdiction have on the model?

Questions to Answer

Formulation

,

min *ij ijyi j E

c y

s.t. ( )Netflow y

( ), ( ) 1Seaworld start Seaworld Endy

( ), ( ) 1USSMidway start USSMidway Endy

( ), ( ) 1TheFields start TheFields Endy

0ijy

From our program the best track would be:

Navy Lodge -> USS Midway USS Midway-> Greek Island Café Greek Island Café -> Sea World Sea World-> Mission Bay Park Mission Bay Park-> The Fields Pub The Fields Pub-> Navy Lodge

Total Time = 738 minsEnough time to relax at the beach back at the hotel!!!

Results

Interdiction/Attacks

First Interdiction:

One Interdiction on the primary road from Sea World to Mission Bay Park only adds a few minutes to the drive, but it does not take it out of the daily activity’s.

Directions change from taking Sea World Drive to I-5 then north to Mission Bay Park Now must take Ocean Beach Freeway to I-5, then north to Mission Bay Park

Interdiction (Cont)

Interdiction/Attacks

Second Interdiction:

Now we have two interdictions on the primary road from Sea World to Mission Bay Park and on I-5. This forces us to use back roads to reach Mission

Bay Park, adding a significant increase in time, causing the model to choose a different location.

Interdiction (Cont)

With the two interdictions taking out time saving

routes to Mission Bay Park, our program decides the next possible route to include Miramar Marine Corps Air Station. Total time for route is now 757 minutes.

Navy Lodge-> USS Midway USS Midway->Greek Islands Café Greek Islands Cafe->Sea World Sea World ->Miramar MCAS Miramar MCAS->The Fields Pub The Fields Pub->Navy Lodge

Results w/Interdiction

Operators Resilience Curve

Baseline 1 2

Nodes 5 5 5

Time 7.38 7.49 7.57

0.5

1.5

2.5

3.5

4.5

5.5

6.5

7.5

# o

f N

od

es /

Min

ute

s (

in

hu

nd

red

s)

* Note: the nodes change yet the number remains the same.

Relativity

New Commander’s Inspection Tour

VIP Visit

Re-Route Troop/Ship/Supply Movement

Disaster Relief

Summary/Follow-up

Need to create a Networks model max visitation within 960 minutes (16 hrs)

Follow-on Considerations Add Cost to Node Add Cost to Edge Add Commodity to Move Adjust Constraints

http://www.sdmts.com/trolley/trolley.asp http://www.sdchamber.org/ http://www.sandiego.org/ https

://maps.google.com/maps?hl=en&tab=wl

References

?

Questions