Your browser (Internet Explorer 8 or lower) is out of date. It has known security flaws and may not display all features of this and other websites. Learn how to update your browser.

X

Menu

ABM

Clone of Parking Lot Problem (WIP)

David Joseph McLaren
This model is a classic instance of an Erlang Queuing Process.
We have the entities:- A population of cars which start off in a "crusing" state;- At each cycle, according to a Poisson distribution defined by "Arrival Rate" (which can be a constant, a function of time, or a Converter to simulate peak hours), some cars transition to a "looking" for an empty space state.- If a empty space is available (Parking Capacity  > Count(FindState([cars population],[parked]))) then the State transitions to "Parked."-The Cars stay "parked" according to a Normal distribution with Mean = Duration and SD = Duration / 4- If the Car is in the state "Looking" for a period longer than "Willingness to Wait" then the state timeouts and transitions to impatient and immediately transitions to "Crusing" again.
The model is set to run for 24 hours and all times are given in hours (or fraction thereof)
WIP:- Calculate the average waiting time;- Calculate the servicing level, i.e., 1- (# of cars impatient)/(#cars looking)
A big THANK YOU to Scott Fortmann-Roe for helping setup the model's framework.

Erlang ABM

  • 5 years 10 months ago

Clone of Electric Car Parking

Wu Ming
This model is a classic instance of an Erlang Queuing Process.
We have the entities:- A population of cars which start off in a "cruising" state;- At each cycle, according to a Poisson distribution defined by "Arrival Rate" (which can be a constant, a function of time, or a Converter to simulate peak hours), some cars transition to a "looking" for an empty space state.- If a empty space is available (Parking Capacity  > Count(FindState([cars population],[parked]))) then the State transitions to "Parked."-The Cars stay "parked" according to a Normal distribution with Mean = Duration and SD = Duration / 4- If the Car is in the state "Looking" for a period longer than "Willingness to Wait" then the state timeouts and transitions to impatient and immediately transitions to "Crusing" again.
The model is set to run for 24 hours and all times are given in hours (or fraction thereof)
WIP:- Calculate the average waiting time;- Calculate the servicing level, i.e., 1- (# of cars impatient)/(#cars looking)
A big THANK YOU to Scott Fortmann-Roe for helping setup the model's framework.

ABM

  • 2 years 3 months ago

Clone of The Game of Life

Bart Bias

An implementation of the classic Game of Life using agent based modeling.

Rules:
  • A live cell with less than two alive neighbors dies.
  • A live cell with more than three alive neighbors dies.
  • A dead cell with three neighbors becomes alive.

ABM KeLE ABM

  • 1 year 11 months ago

Senate

Anna Engelsone
A simple Markov chain modeling the transfer of power between two parties in the US Senate. Developed using data from FiveThirtyEight.com for the years 1978-2018.
Transition matrix:
       R   DR    .7   .3D    .4   .6

ABM Markov Chain Politics

  • 7 months 2 weeks ago

Pages