https://github.com/yzernik/elevatorcontrolsystem

https://github.com/yzernik/elevatorcontrolsystem

Last synced: 28 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/yzernik/elevatorcontrolsystem
• Owner: yzernik
• Created: 2015-10-06T23:45:25.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2015-10-07T01:23:22.000Z (about 9 years ago)
• Last Synced: 2023-03-24T19:15:15.980Z (over 1 year ago)
• Language: Scala
• Size: 125 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Elevator Control System

### Interfaces

There is one main interface. The ElevatorControlSystem

```Scala

trait ElevatorControlSystem {

  def status: Seq[ElevatorStatus]

  def update(id: Int, status: ElevatorStatus): Unit

  def requestPickup(floor: Int, direction: Direction): Unit

  def getCommand(id: Int): ElevatorCommand

}

```

where the ElevatorStatus is

```Scala

case class ElevatorStatus(floor: Int,

                          goals: List[Int],

                          direction: Option[Direction],

                          isLoading: Boolean)

```

### Data Structures

The `ElevatorControlSystem` stores the current status of the elevators in a 

map with the id of the elevator as the key, and the status as the value.

The `ElevatorControlSystem` also has a representation of the 

`PickupRequest`'s that have been made. I use Scala's mutable Queue to store 

the pickup requests.

For the simulation, I represent an Elevator with a floor number and

passengers. I use a Set to represent the set of passengers on the elevator.

### Algorithm

On each step, each elevator can move up, move down, or open the door.

For an elevator that has passengers

* if the current floor is a goal floor, open the door

* if the current floor has a pickup request in the same direction, open the door

* otherwise, continue to the goals

For an elevator that has no passengers

* If there are any pickup requests, move to one of them and then open the door

* otherwise, open the door.

The scheduling algorithm depends on the choice of which pickup request will be 

chosen by an empty elevator. My algorithm chooses either the lowest Up request, 

or the highest Down request. This is meant to make the scheduling more fair 

for passengers at the top and bottom of a building.

### Instructions

To run the simulation

```

sbt run

```