Brief overview

Algorithm

folder structure

class structure

testing

running the simulation

results

assigment instructions

UML

bonus graphic simulation

In this assigment we were requested to make an offline algorithm for a building with elevators. We were given a tester, and some scenarios to try. Our algorithm used the same techniques as our online algorithm from Ex0. It was a greedy algorithm that estimated the cost of every call on every elevator, and the call would be given to the elevator that will loss less time.

Here are some useful resources that I used and helped me with the algorithm:

https://elevation.fandom.com/wiki/Destination_dispatch

https://github.com/do-ryan/destination-dispatch-elevator-simulation

https://www.youtube.com/watch?v=xOayymoIl8U

https://github.com/Daniel-Ros/OOP1

We implemented the same greedy algorithm that we used in Ex0 but with some changes to how the position is tracked. The goal in this algorithm is to try and calculate the amount of time ot will take each elevator to finish it's current and the new call given, the elevator with the lowest time is the elevator we will assing the call to.

The workspace contains two folders by default, where:

• Ex1_Buildings: the folder with all the building to the scenarios
• Ex1_Calls: the folder with all the calls files
• Bonus: this folder contains the java code for the Bonus
• .: the folder with the code itself and the tester

being an OOP course we had to make our classes to accomplish out desired algorithm. The classes we implemented are:

this project was test using the UniTest library. the tests can be run by an IDE of choice.

Make sure you have java (tested on 1.8.0_292) and python 3 install and configured on you machine. clone the project:

git clone https://github.com/Daniel-Ros/OOP2.git

run the python script:

python3 Ex1.py <Building json> <Calls csv> <output name>

run the simulator

java -jar Ex1_checker_V1.2_obf.jar 1111,2222,3333 <Building json> <output name> <output log file>

or use the python script that runs all the combination of building/calls that are in the correct folders:

git clone https://github.com/Daniel-Ros/OOP2.git
python3 run_all.py

then a file name detailed_report.csvwill appear with all the building/calls combination runs

These are the final results that I was able to get

There were some stages that I got a bit more, but really hurted other stages, soI had to balance it

all results were uploaded to the Google form

Google doc : here

Testing jar : here

GitHub: project files

Google Form: here

Reported results (by students) : here

Youtube (bonus section , made in Java StdDraw) : here

Blue = Call , Yellow = Call destination , Green = Elevator , Light Green = Zero floor

Sample from youtube video

This is based on the ex0 assignment, We implemented the elevator logic as described in the assigment requirements And added the drawing capabilities, In fact, it will work with any elevator algorithm or building.To make it work, simply add the ShabatElev3Algo.java file to the previous assigment and run it.

The building and elevators are drawn dynamically by the number of floors/elevators and the live elevator position