Elevator Algorithms, Briefly
Elevator scheduling is a classic optimization problem: how do you move people efficiently between floors? Try the interactive demo below to see how different algorithms perform!
Main Algorithms
- FCFS: Serve requests in order of arrival (simple, but inefficient)
- SCAN: Move in one direction, then reverse (reduces wait times)
- LOOK: Like SCAN, but only goes as far as the last request (more efficient)
Try the Simulation
- Pick a traffic pattern (rush hour, random, etc.)
- Start/Stop, adjust request rate, and switch algorithms
- Watch how elevator behavior changes in real time
Simulation Controls
Algorithm:
0
↑0
↓0
0
1
↑0
↓0
0
2
↑0
↓0
0
3
↑0
↓0
0
4
↑0
↓0
0
5
↑0
↓0
0
6
↑0
↓0
0
7
↑0
↓0
0
0
0
↑0
↓0
0
1
↑0
↓0
0
2
↑0
↓0
0
3
↑0
↓0
0
4
↑0
↓0
0
5
↑0
↓0
0
6
↑0
↓0
0
7
↑0
↓0
0
0
System Metrics
Average Wait:
0s
Total Distance:
0 floors
Longest Wait:
0s
Requests Served:
0 / 0
Pending Requests:
0
Pending Requests
| From | To | Wait Time |
|---|