CSCE782 Project-Omor Sharif - page 1

Size: px

Start display at page:

Download "CSCE782 Project-Omor Sharif - page 1"

Job Harris
6 years ago
Views:

1 globals[ link-table node-coordinates link-travel-time-by-link-id origin-table water-level breed [cars car breed [nodes node nodes are intersections breed [bridges bridge breed [vmss vms variable message signs operated by Traffic Management Center (TMC) cars-own[ origin destination shortest-path shortest-path-nodes counter -time my-od-travel-time speed links-own[ id link-travel-time my-patch-set nodes-own [cost bridges-own [bridge-id pof pof - probability of failure vmss-own [message message tmc displays currently to setup (for this model to work with NetLogo's new plotting features, clear-all-and-reset-ticks should be replaced with clear-all at the beginning of your setup procedure and reset-ticks at the of the procedure.) clear-all-and-reset-ticks file-close-all random-seed seed ask patches [set pcolor white setup-network setup-cars setup-bridges setup-reroute-links setup-vmss my-update-plots to setup-network setup-nodes setup-links CSCE782 Project-Omor Sharif - page 1

2 to setup-nodes set node-coordinates [[0 5 18[ [ [ [ [ [ [ [8 45 2[ [ create-nodes 11 foreach node-coordinates [ ask node (item 0?) [ setxy item 1? item 2? set shape "circle" set size 1.4 set color gray set label-color yellow set label who to setup-links set link-table [[1 0 1[2 0 2[3 0 9[4 1 3[5 2 3[6 1 4[7 2 5[8 3 5[9 3 4[10 4 6[ [12 5 6[13 1 7[14 7 4[15 2 8[16 8 5[17 9 3[ [19 9 1[20 9 2[ [ foreach link-table [ ask node (item 1?) [ create-link-to node (item 2?) [set id item 0? set thickness 0.75 set color gray set label-color black set label id ask links [generate-my-patch-set ask links [ifelse (dynamic-shortest-path?) [set link-travel-time 0 [set link-traveltime link-length ask links [set link-travel-time-by-link-id map[[link-travel-time of? (sort-by[[id of?1 < [id of?2 links) to generate-my-patch-set foreach sort links [ ask? [ let i 0 let ps nobody let one-patch nobody while [i <= floor link-length - 1 [let lh link-heading ask 1 [set one-patch patch-at-heading-and-distance lh (i + 1) set ps (patch-set ps one-patch) CSCE782 Project-Omor Sharif - page 2

3 set i i + 1 set my-patch-set ps to layout layout-spring nodes links if mouse-down? [ let nearest-turtle min-one-of turtles [distancexy mouse-xcor mouse-ycor while [mouse-down? [ ask nearest-turtle [setxy mouse-xcor mouse-ycor ask turtles [ set heading towardsxy 0 0 forward random 5 to setup-cars create-cars num-of-cars [ setup-origin-destination move-to origin set speed random-float 0.9 to setup-origin-destination set origin one-of (list node 0) (list node 0 node 1 node 2) set origin-table map[[origin of? (sort cars) set destination node 6 to compute-shortest-path dijktra's algorithm for shortest path let y 0 let solved-node-set (list origin) initialize set of solved nodes let shortest-path-tree [ ask origin [set cost 0 assign cost 0 to the origin let min-length 1000 let node-to-add 0 let i 1 while [i <= count nodes - 1 [ foreach solved-node-set [ if (any? my-links with [not member? other- solved-node-set) [ ask? [ if (any? my-out-links with [not member? other- solved-node-set) [ let x min [link-travel-time of my-out-links with [not member? other- solvednode-set let closest-unsolved-node [other- of one-of my-out-links with [link-traveltime = x and not member? other- solved-node-set let length-of-path-to-unsolved-node ([cost of self + x) if (length-of-path-to-unsolved-node <= min-length) [ set min-length length-of-path-to-unsolved-node CSCE782 Project-Omor Sharif - page 3

4 set node-to-add closest-unsolved-node set y? set shortest-path-tree lput link ([who of y) ([who of node-to-add) shortest-pathtree ask node-to-add [set cost min-length set min-length 1000 set solved-node-set lput node-to-add solved-node-set set i i + 1 show shortest-path-tree ask links with [member? self shortest-path-tree [set color blue show solved-node-set Extract shortest path between origin and destination from shortest path tree let en destination let s origin let t 0 set shortest-path [ while [en!= s [ ask en [ask my-in-links with [member? self shortest-path-tree [ set t self the link ask en [set en [other- of t ask myself [set shortest-path fput t shortest-path set shortest-path-nodes [ set shortest-path-nodes map [[1 of? shortest-path set shortest-path-nodes lput [2 of (last shortest-path) shortest-path-nodes show shortest-path-nodes to setup-bridges set bridge-1 patches with [(pxcor <= 33) and (pxcor >= 30) and (pycor = 18) set bridge-2 patches with [(pxcor <= 73) and (pxcor >= 70) and (pycor = 18) let bridges (patch-set bridge-1 bridge-2) ask bridges [set pcolor green create-bridges 2 ask bridge (count nodes + count cars) [setxy ask first sort bridges [setxy set bridge-id "B1" set pof 0 ask bridge (count nodes + count cars + 1) [setxy ask item 1 sort bridges [setxy set bridge-id "B2" set pof 0 ask bridges [set shape "square" set color 38 set size 1.75 set label-color black set label bridge-id to setup-reroute-links CSCE782 Project-Omor Sharif - page 4

5 let set1 (turtle-set node 1 node 2) let set2 (turtle-set node 4 node 5) ask item 0 sort bridges [create-links-to set1 ask node 9 [create-links-to set1 [set color ask item 1 sort bridges [create-links-to set2 ask node 10 [create-links-to set 2 ask bridges [ask my-out-links [ set thickness 0.50 set color 38 set label-color black set id "" set label id ask bridges [ask my-out-links [generate-my-patch-set ask bridges [ask my-out-links [ifelse (dynamic-shortest-path?) [set link-travel-time 0 [set link-travel-time link-length ask links with [1 = one-of bridges [set link-travel-time-by-link-id map[[linktravel-time of? (sort-by[[id of?1 < [id of?2 links) to setup-vmss if (TMC?) [ create-vmss 1[ set shape "computer workstation" set color brown set size 2 setxy 78 1 set message "Have a nice day!" set label-color black set label message to go water-agent-do-your-thing bridges-do-your-thing tmc-do-your-thing ask cars [ if (dynamic-shortest-path?) [update-link-travel-time dynamic shortest path implies travel time of links are updated based on traffic condition, static means just use link-length ask cars [ check any warning message displayed at vms issued by TMC if (tmc? = true and [message of one-of vmss = "B2 closed- reroute whenever possible") [ask link 10 6 [set link-travel-time arrived at a bridge? If the bridge is found inoperative, reroute from that node if (one-of bridges-here!= nobody) [let brg one-of bridges-here CSCE782 Project-Omor Sharif - page 5

6 ifelse ([color of brg = blue) set origin one-of nodes-here [ask link 10 6 [set link-travel-time [ask link 10 6 [set link-travel-time link-length arrived at an intersection? set origin to current intersection and re-compute shortest path if arrived at destination move to actual origin if (one-of nodes-here!= nobody) [let t one-of nodes-here ifelse (t!= destination) [set origin t [calculate-my-od-travel-time set origin item (who - count nodes) origin-table move-to item (who - count nodes) origin-table compute-shortest-path move-forward ask links [set label precision link-travel-time 2 my-update-plots tick to move-forward determine new heading of cars when they arrive at an intersection according to the current shortest-path-nodes if (one-of nodes-here!= nobody) [let t one-of nodes-here move-to t realign if (t!= destination) [let p position t shortest-path-nodes face item (p + 1) shortest-path-nodes if (t = item (who - count nodes) origin-table) [face item 1 shortest-path-nodes car transmission - car following behavior ifelse (car-following-behavior? = true) [ let my-view (patch-set patch-ahead 1 patch-right-and-ahead 45 1 patch-right-andahead 90 1 patch-left-and-ahead 45 1 patch-left-and-ahead 90 1) let my-view patches in-cone let car-ahead one-of cars-on my-view if (car-ahead = one-of other cars) [set speed [speed of car-ahead set speed speed - deceleration if (car-ahead = nobody or car-ahead = self) [set speed speed + acceleration if speed < 0 [ set speed 0 if speed > 1 [ set speed 1 fd speed [ifelse (not any? cars-on patch-ahead 1 or one-of cars-on patch-ahead 1 = self) [fd 1 CSCE782 Project-Omor Sharif - page 6

7 [fd 0 to update-link-travel-time count number of cars at each tick and update link-travel-time of link accordingly if (link-travel-time-update-strategy = "count-cars-on-link") [ ask links [set link-travel-time (count cars-on my-patch-set + 1) + round link-length whenever a car arrives at an intersection it reports its travel time of the last traversed link if (link-travel-time-update-strategy = "just-arrived-at-intersection") [ if (one-of nodes-here!= nobody) [let t one-of nodes-here if (t!= origin) [ let p position t shortest-path-nodes p is number set p item (p - 1) shortest-path-nodes p is node agent ask link ([who of p) ([who of t) [set link-travel-time (ticks - [counter of myself) set counter ticks to calculate-my-od-travel-time if (one-of nodes-here!= nobody) [let t one-of nodes-here if(t = item (who - count nodes) origin-table) [set start-time ticks if(t = destination) if (ticks > -time) [set my-od-travel-time ticks - -time set -time ticks to reroute set heading towards one-of (list node 4 node 5) water agent procedures to water-agent-do-your-thing import gage readings file-open "Gage Height Data 11 Nov.txt" ifelse (not file-at-?) [if ((ticks mod 30) - 0 = 0) [ set water-level file-readreport water level every 15 ticks [file-close bridge agent procedures to bridges-do-your-thing CSCE782 Project-Omor Sharif - page 7

8 ask bridges with [bridge-id = "B2" [ifelse (water-level >= threshold) [set pof 80 set color blue [set pof random 80 set color 38 to tmc-do-your-thing ask vmss [ let btwo one-of bridges with [bridge-id = "B2" ifelse ([pof of btwo >= 80) [set message "B2 closed- reroute whenever possible" set label message [set message "Have a Nice Day!" set label message to my-update-plots set-current-plot "Travel Time" plot (sum [my-od-travel-time of cars) set-current-plot "Water Gage Readings" set-current-plot-pen "Water Level" plot water-level set-current-plot-pen "Threshold" plot threshold CSCE782 Project-Omor Sharif - page 8

NETLOGO 6.0 QUICK GUIDE

Agents NETLOGO 6.0 QUICK GUIDE Luis R. Izquierdo (http://luis.izqui.org) The NetLogo world is made up of agents. Agents are beings that can follow instructions. There are four types of agents: Turtles.