-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmontecarlo.ts
38 lines (34 loc) · 1.27 KB
/
montecarlo.ts
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
import { Hairdresser } from "./hairdresser";
import { Queue } from "./queue";
import { Simulation } from "./simulation";
/**
* This class runs a number of simulations, and average their expected times
* By adjusting the parameter to getNextEstimatedWaitingTime you can gauge the sensitivity of number of simulations.
*/
export class Montecarlo {
private hairdressers: Hairdresser[];
private queue: Queue;
constructor(hairdressers: Hairdresser[], queue: Queue) {
this.hairdressers = hairdressers;
this.queue = queue;
}
public getNextEstimatedWaitingTime(simulationCount: number): number {
let simulationTimes = []
for (let i = 0; i < simulationCount; i++) {
let hairdressers = []
this.hairdressers.forEach(hs => hairdressers.push(hs.copy()))
let simulation = new Simulation(hairdressers, this.queue.copy());
let simulatedTime = simulation.runSimulation()
simulationTimes.push(simulatedTime)
}
// Calculate a boring average over simulations.
// Future work would be to find spread/variation,
// and select a percentile that balance customer satisfaction with total throughput
let sum = 0;
for(let i = 0; i < simulationTimes.length; i++) {
sum += simulationTimes[i];
}
const average = sum / simulationTimes.length;
return average
}
}