-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBankSimulation.cpp
430 lines (316 loc) · 10.3 KB
/
BankSimulation.cpp
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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
// BankSimulation.cpp
// by Ben Van de Brooke
// On 10/31/16
// Editor: X-Code
// Compiler: GCC
// Description: A simulation of interactions at a bank
#include <iostream>
#include <vector>
#include <list>
#include <queue>
#include <string>
#include <sstream>
#include <fstream>
#include <cstdlib>
#include <cmath>
#include <ctime>
using namespace std;
struct Customer
{
char name;
int arrival, served, end;
Customer():name('?'),arrival(0),served(0),end(0){};
bool operator <(const Customer &otherCustomer) const
{
return name > otherCustomer.name;
}
};
struct Message
{
int serverNum, endTime;
Message():serverNum(0),endTime(0){};
//places the lowest time at the top of the priorityqueue
bool operator <(const Message &otherMessage) const
{
return endTime > otherMessage.endTime;
}
};
struct serverElements
{
bool inUse;
Customer aCustomer;
serverElements(): inUse(false){};
};
int numEmptyWindows(const vector<serverElements> &windowBank)
{
int boredTellers = 0;
for(serverElements x : windowBank)
{
if(!x.inUse)
{
boredTellers++;
}
}
return boredTellers;
}
//taken from canvas
int getRandomNumberOfServiceRequests(double averageRequestsPerTimeStep)
{
int requests = 0;
double probOfnRequests = exp(-averageRequestsPerTimeStep);
for (double randomValue = (double)rand() / RAND_MAX;
(randomValue -= probOfnRequests) > 0.0;
probOfnRequests *= averageRequestsPerTimeStep / (double)++requests);
return requests;
}
//getNextName
// returns the next letter of the alphabet, wraps back to A from Z
//taken from canvas
char getNextName(int &totalCustomersCreated)
{
return (char)('A' + (totalCustomersCreated++ % 26));
}
void updateBank(const int & time, vector<serverElements>& windowBank, deque<Customer>& theLine, vector<Customer>& completedCustomers, int &numRejects, priority_queue<Message> &timer, const int &arrivalRate, const int &queueCap, int & totalCustomersCreated, const int &numServers,const int &minServiceTime,const int &maxServiceTime)
{
//check to see if the person at the front of the windowQueue is ready to pop
// if so pop them
// check again
int newCustomers = getRandomNumberOfServiceRequests(arrivalRate);
bool customersLeaving = true;
bool freeWindow = false;
priority_queue<int> freeWindows;
priority_queue<Customer> customersToAdd; //used to add new customers to appropriate place
Customer newCustomer;
//creating list of free windows
for(int x = 0; x < windowBank.size();x++)
{
if(!windowBank.at(x).inUse)
{
freeWindows.push(x);
}
}
newCustomer.arrival = time;
//makes a priorityQueue full of the customers to be added
for(int x = 0; x < newCustomers; x++)
{
newCustomer.name = getNextName(totalCustomersCreated);
customersToAdd.push(newCustomer);
}
//MOVING PEOPLE FROM THE WINDOWS TO COMPLETED CUSTOMER LIST
//if there is a customer ready to move from the window
while(customersLeaving)
{
if(!timer.empty() && timer.top().endTime == time)
{
int customerLocation = timer.top().serverNum;
//adds them to the completed customers list
windowBank.at(customerLocation).aCustomer.end = time;
completedCustomers.push_back(windowBank.at(customerLocation).aCustomer);
timer.pop();
//clears customer from window
windowBank.at(customerLocation).inUse = false;
windowBank.at(customerLocation).aCustomer.name = '~';
freeWindows.push(customerLocation);
//freeWindow = true;
}
else
{
customersLeaving = false;
}
}
//MOVING PEOPLE FROM THE LINE TO THE WINDOWS
//if there is someone at the front of the line, move them to an open window until there are no more empty windows.
while(theLine.size() != 0 && freeWindows.size() > 0)
{
//find first free windown
int firstFreeWindow = freeWindows.top();
freeWindows.pop();
// assign that elements aCustomer to theLine.front()
theLine.front().served = time;
windowBank.at(firstFreeWindow).aCustomer = theLine.front();
windowBank.at(firstFreeWindow).inUse = true;
Message newMessage;
newMessage.serverNum = firstFreeWindow;
newMessage.endTime = time + (rand() % (maxServiceTime-minServiceTime + 1) + minServiceTime);
timer.push(newMessage);
//takes away first in line
theLine.pop_front();
if(freeWindows.empty())
{
freeWindow = false;
}
}
// LET PEOPLE INTO THE BANK
while(customersToAdd.size() > 0)
{
if(freeWindows.size() > 0) //if free window available
{
int firstFreeWindow = freeWindows.top();
freeWindows.pop();
windowBank.at(firstFreeWindow).aCustomer = customersToAdd.top();
windowBank.at(firstFreeWindow).inUse = true;
Message newMessage;
newMessage.serverNum = firstFreeWindow;
newMessage.endTime = time + (rand() % (maxServiceTime-minServiceTime + 1) + minServiceTime);
timer.push(newMessage);
customersToAdd.pop();
}
else if (theLine.size() < queueCap) // no room at window, add to line until its full
{
theLine.push_back(customersToAdd.top());
customersToAdd.pop();
}
else // no room in line, add to rejects
{
numRejects += customersToAdd.size();
while (!customersToAdd.empty())
{
customersToAdd.pop();
}
}
}
}
void printCurrentState(const int & time, const vector<serverElements>& windowBank, const deque<Customer>& theLine, const vector<Customer>& completedCustomers, const int &numRejects, const int &totalCustomersCreated, const priority_queue<Message> & timer, const int &numServers)
{
bool queuePrinted = false;
cout << endl << endl;
cout << "Time: " << time << endl;
cout << "----------------------------------" << endl;
cout << " Window Now Serving Waiting " << endl;
cout << "----------------------------------" << endl;
for(int x = 0,y = numServers -1; x < windowBank.size(); x++,y--)
{
cout << " "<< x << " ";
if(windowBank.at(y).inUse)
{
cout << windowBank.at(y).aCustomer.name;
}
if(!queuePrinted)
{
queuePrinted = true;
cout << " ";
for(int y = 0; y < theLine.size(); y++)
{
cout << theLine.at(y).name;
}
}
cout << endl;
}
if(time != 0)
{
int timeWaited = 0;
//to calculate average time from arrival to end
for(int x = 0; x < completedCustomers.size(); x++)
{
timeWaited += (completedCustomers[x].end - completedCustomers[x].arrival);
}
cout << "----------------------------------" << endl;
if(completedCustomers.empty())
{
cout << "Average time: 0" << endl;
}
else
{
cout << "Average time: " << (timeWaited / completedCustomers.size()) << endl;
}
cout << "Turned away per minuet " << (numRejects / time) << endl;
}
cout << endl << endl;
}
int main()
{
//Universal Program Requirements
cout << "BankSimulation.cpp " << endl;
cout << "by Ben Van de Brooke" << endl;
cout << "On 10/31/16" << endl;
cout << "Editor: X-Code" << endl;
cout << "Compiler: GCC" << endl;
cout << "Description: A simulation of server/client interactions" << endl<< endl;
//seeding the rand function (and "priming" it?)
srand((unsigned int)clock());
rand();
int numServers = 0, minServiceTime = 0, maxServiceTime = 0, arrivalEnd = 0, queueCap = 0, numRejects = 0, time = -1, totalCustomersCreated = 0;
double arrivalRate = 0, x = 0;
string input = "";
vector<double> fileData;
ifstream inFile;
inFile.open("simulation.txt");
//
//set up
//
if(inFile.good())
{
//fill a vector with data from the file
while(inFile)
{
getline(inFile,input);
stringstream(input) >> x;
fileData.push_back(x);
}
//fills up the data into their variables
for(int x = 0; x < 6; x++)
{
switch (x)
{
case 0: numServers = fileData.at(x);
break;
case 1: arrivalRate = fileData.at(x);
break;
case 2 : queueCap = fileData.at(x);
break;
case 3 : minServiceTime = fileData.at(x);
break;
case 4 : maxServiceTime = fileData.at(x);
break;
case 5 : arrivalEnd = fileData.at(x);
break;
default: cout << "file read error(switch)!" << endl;
break;
}
}
//creates containers to hold data
deque<Customer> theLine;
vector<serverElements> windowBank(numServers);
priority_queue<Message> timer;
vector<Customer> completedCustomers;
//output the read values
cout << "number of servers: " << numServers << endl;
cout << "arrival rate: " << arrivalRate << " per minuet for " << arrivalEnd << " minuets." << endl;
cout << "max queue length: " << queueCap << endl;
cout << "minimum service time: " << minServiceTime << endl;
cout << "max service time: " << maxServiceTime << endl << endl << endl;
//
// the meat of the program
//
while(input != "X" && input != "x")
{
time++;
if(time < arrivalEnd)
{
if(time == 0)
{
updateBank(time,windowBank,theLine,completedCustomers,numRejects,timer,arrivalRate, queueCap, totalCustomersCreated,numServers, minServiceTime,maxServiceTime);
}
//display regular info
printCurrentState(time,windowBank, theLine,completedCustomers, numRejects, totalCustomersCreated, timer, numServers);
//get user input
getline(cin, input);
//if ok update
if(input != "X" && input != "x")
{
updateBank(time,windowBank,theLine,completedCustomers,numRejects,timer,arrivalRate, queueCap, totalCustomersCreated,numServers, minServiceTime,maxServiceTime);
}
}
else
{
printCurrentState(time,windowBank, theLine,completedCustomers, numRejects, totalCustomersCreated, timer,numServers);
getline(cin, input);
}
}
}
else
{
cout << "File error" << endl;
}
return 0;
}