Article
The article treats elevator operation as a scheduling optimization problem and explains classical strategies from SCAN, where a car runs to the top before reversing, to LOOK, which reverses at the highest requested floor. It argues that wait-time quality is best judged through latency distributions, especially p90 rather than averages, because long-tail delays dominate user frustration. It then extends from one car to fleets, showing naïve nearest-car assignment and a smarter RSR approach that score-scores cars by proximity, anti-bunching, nearby-idle status, and five-second re-optimization. Real traffic is shown to matter: morning lobby-to-floor spikes and evening floor-to-lobby reverse flow change performance, and both traffic composition and building size influence outcomes. Benchmarking suggests LOOK can beat RSR under heavy saturation or small banks, where extra heuristic complexity adds little, while RSR tends to help in lighter-to-moderate load conditions. A major case study is destination dispatch: although intuitive, preassigned destination entry can reduce flexibility, so the article’s simulations find it can worsen waits versus floor buttons except in tall, high-car-count buildings. The piece notes journey time differences exist but are not deeply explored, and concludes that algorithmic dispatch is constrained not just by math but by uncertain demand and dynamic rebalancing. Comments repeatedly point to real-world mismatch between models and operations, with many reporting full-car blocking, odd call-button behavior, and the practical pain of perceived delays when elevators park poorly or fail at capacity management.
Commenters validate the core idea that full-car behavior, crowding, and uneven arrival patterns are the hardest real-world problems, often with concrete examples of half-hour waits, saturated weekend traffic, and lobbies overwhelmed while cars idle on upper floors. Many confirm that users and operators often violate assumptions: people misuse up/down buttons, ignore intended flow patterns, or struggle with destination-dispatch UX, especially when assigned cars are physically hard to find. Several challenge the conclusion by citing buildings where destination dispatch helps because destinations are highly clustered, while others say traditional buttons feel more robust and less cognitively demanding. Others add operational concerns absent from the article, including wear-and-tear trade-offs, parking/standby policies, door timing, priority service, and maintenance costs versus wait-time fairness. Security and infrastructure anecdotes include double-deck and twin-shaft variants, hotel and cruise-ship deployments, and interviews where dispatch remains an interview problem despite decades of engineering. A recurring theme is that perceived waiting is as important as raw metrics, and behavioral cues or UI detail can be as impactful as algorithmic optimization. The discussion also expands into tooling and culture: elevator simulators, game design, interview questions, historical relay logic, and broader transport analogies to disk scheduling and dial-a-ride optimization.