-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
177 lines (156 loc) · 8.29 KB
/
Main.java
File metadata and controls
177 lines (156 loc) · 8.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
import java.io.FileInputStream;
import java.io.IOException;
import java.util.*;
class Main {
public static void main(String[] args) {
//Read in values from a property file to use in the rest of my code
Properties propertyFile = new Properties();
if (args.length > 0) {
String file = args[0]; //set it as the first agrument
try (FileInputStream input = new FileInputStream(file)) {
propertyFile.load(input);
} catch (IOException e) {
e.printStackTrace();
}
} else {
propertyFile.setProperty("structures", "linked");
propertyFile.setProperty("floors", "32");
propertyFile.setProperty("passengers", "0.03");
propertyFile.setProperty("elevators", "1");
propertyFile.setProperty("elevatorCapacity", "10");
propertyFile.setProperty("duration", "500");
}
//Instantiate the property file keys and values
String structureType = propertyFile.getProperty("structures");
int numFloors = Integer.parseInt(propertyFile.getProperty("floors"));
double passengerProbability = Double.parseDouble(propertyFile.getProperty("passengers"));
int elevatorCap = Integer.parseInt(propertyFile.getProperty("elevatorCapacity"));
int simDuration = Integer.parseInt(propertyFile.getProperty("duration"));
//Create an elevator, arraylist of floors, and a deque of all the passengers based on a structure type
Elevator elevator = new Elevator(elevatorCap);
List<Floor> floors = new ArrayList<>();
Deque<Passenger> allPassengers = PassList.createPassengerQueue(structureType);
Random random = new Random();
//Initialize all the floors till the total
for (int i = 1; i <= numFloors; i++) {
floors.add(new Floor(i));
}
//For each tick, the elevator releases passengers, moves to the next closest floor, boards/releases passengers
for (int tick = 0; tick < simDuration; tick++) {
//For some floors, I create new passengers that are waiting
for (Floor floor : floors) {
if (random.nextDouble() < passengerProbability) {
int newDestination = random.nextInt(numFloors) + 1;
Passenger newPassenger = new Passenger(floor.getFloorNum(), newDestination);
floor.addPassenger(newPassenger);
allPassengers.add(newPassenger);
System.out.println("New passenger on floor " + floor.getFloorNum() + " going to floor " + newDestination);
}
}
elevator.releasingPassengers(); //if there are passengers to be released on the current floor
//Go to the closest floor then board/release and move further
int closestFloor = findClosestFloorWithPassengers(elevator, floors);
System.out.println("Closest floor with passengers: " + closestFloor);
if (elevator.getCurrentFloor() != closestFloor) {
moveElevator(elevator, closestFloor, floors);
boardingPassengers(elevator, floors.get(elevator.getCurrentFloor() - 1));
elevator.releasingPassengers();
moveElevator(elevator, elevator.getPassengers().get(0).getDestination(), floors);
elevator.releasingPassengers();
} else {
System.out.println("Elevator is already on closest floor with passengers");
Floor currentSimulationFloor = floors.get(closestFloor-1);
Queue<Passenger> waitingPassenger = currentSimulationFloor.getWaitingPassengers();
//Checks if there are any passengers waiting on the closest floor
if (!waitingPassenger.isEmpty()) {
for (Passenger passenger : waitingPassenger) {
elevator.boardPassengers(passenger);
moveElevator(elevator, closestFloor, floors);
currentSimulationFloor.removePassenger(passenger);
}
}
}
}
simulationStatistic(allPassengers); //Prints the simulation times
}
private static int findClosestFloorWithPassengers(Elevator elevator, List<Floor> floors){
int closestFloor = -1;
int minDistance = Integer.MAX_VALUE;
for (Floor floor : floors) {
if (!floor.getWaitingPassengers().isEmpty()) {
//Finds the distance of each floor to the current floor to find the closest one with passengers
int distance = Math.abs(floor.getFloorNum() - elevator.getCurrentFloor());
if (distance < minDistance) {
minDistance = distance;
closestFloor = floor.getFloorNum();
}
}
}
//This means it did not find any closestFloor
if (closestFloor == -1) {
closestFloor = elevator.getCurrentFloor();
}
return closestFloor;
}
//This method moves the elevator towards the desired floor, stoppig to pick up passengers along the way
private static void moveElevator(Elevator elevator, int destinationFloor, List<Floor> floors){
if (elevator.getCurrentFloor() < destinationFloor) {
while (elevator.getCurrentFloor() < destinationFloor) {
int currentFloor = elevator.getCurrentFloor();
elevator.moveUp();
if(currentFloor < floors.size()){
Floor floorObj = floors.get(currentFloor-1);
if (!floorObj.getWaitingPassengers().isEmpty()) {
boardingPassengers(elevator, floorObj);
System.out.println("Passenger was picked up on floor " + currentFloor);
}
}
}
} else if (elevator.getCurrentFloor() > destinationFloor) {
while (elevator.getCurrentFloor() > destinationFloor) {
int currentFloor = elevator.getCurrentFloor();
elevator.moveDown();
if (currentFloor > 0){
Floor floorObj = floors.get(currentFloor-1);
if (!floorObj.getWaitingPassengers().isEmpty()) {
boardingPassengers(elevator, floorObj);
System.out.println("Passenger was picked up on floor " + currentFloor);
}
}
}
}
}
//Passengers are boarded if the waitingPassengers queue is not empty on a floor
private static void boardingPassengers(Elevator elevator, Floor floor){
while (!floor.getWaitingPassengers().isEmpty()) {
Passenger passenger = floor.getWaitingPassengers().poll();
elevator.boardPassengers(passenger);
}
}
//Finds the longest, avg, and shortest times of each passenger to their prefered floor
public static void simulationStatistic(Deque<Passenger> passengers){
long totalDestinationTime = 0;
long longestTime = Long.MIN_VALUE;
long shortestTime = Long.MAX_VALUE;
//For every passenger, the total time traveled until destination is calculated and stored as either longest or shortest
for (Passenger passenger : passengers) {
long destinationTime = Math.abs(passenger.getDestinationTime() - passenger.getArrivalTime());
totalDestinationTime += destinationTime;
if (destinationTime > longestTime) {
longestTime = destinationTime;
}
if (destinationTime < shortestTime && destinationTime >= 0) {
shortestTime = destinationTime;
}
}
//Prints the average when the total is a positive number to ensure it makes sense
int totalPassengers = passengers.size();
if (totalDestinationTime >= 0) {
long averageTime = totalDestinationTime / totalPassengers;
System.out.println("Average Time: " + averageTime + " milliseconds");
}
//Prints shortest and longest wait times
System.out.println("Longest Time: " + longestTime + " milliseconds");
System.out.println("Shortest Time: " + shortestTime + " milliseconds");
}
}