Destination dispatch¶

An elevator-control strategy that groups passengers by requested destination before boarding and assigns them to cars to reduce stops and aggregate delay.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4128
Domain group: Applied Sciences & Engineering
Origin domain: Engineering & Design (beyond software)
Subdomain: Vertical Transportation Control → Engineering & Design (beyond software)

Core Idea¶

Users enter destinations at the lobby or landing, the controller predicts demand and car trajectories and displays an assignment; objectives balance waiting, travel, crowding, accessibility and robustness. Requests with compatible routes are clustered, a scheduling optimizer estimates the incremental cost of assigning each group to each car and a selected assignment is communicated before arrival. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Tell the Elevator Your Floor

In some tall buildings, you don't just press 'up' for the elevator. You tell a screen which floor you want, and it tells you which elevator to get in. The building puts people going to nearby floors in the same elevator so everyone gets there faster. That is destination dispatch.

Floor-First Elevator Matching

With destination dispatch, people type their destination floor on a keypad or screen in the lobby or hallway instead of pressing just 'up' or 'down'. A computer controlling a group of elevators looks at everyone's requests, guesses how busy things will be, and groups people going to similar floors into the same car. It then shows each person which elevator to use before it arrives. The goal is to balance shorter waits, faster rides, less crowding, and making sure it works for everyone, including people with disabilities.

Destination-Based Elevator Assignment

Destination dispatch is an elevator-group control method in which passengers enter their destination at the lobby or landing rather than pressing a direction button. The controller predicts demand and the future movements of each car, groups requests with compatible routes, and uses a scheduling optimizer to estimate the extra cost of giving each group to each car. It then picks an assignment and tells passengers which car to board before it arrives. Its objectives balance waiting time, travel time, crowding, accessibility, and robustness to surprises. Designing one also involves the user interface, accessibility features, backup behavior if something fails, and what happens during an evacuation.

Destination dispatch is a vertical-transportation control strategy in which passengers register destination floors at the lobby or landing, and the group controller assigns them to specific cars before arrival. Using origin-destination requests, a demand model, and each car's state and capacity, the controller predicts car trajectories, clusters requests with compatible routes, and has a scheduling optimizer estimate the incremental cost of assigning each group to each car. The selected assignment is shown to passengers through the user interface. Assignment objectives balance waiting time, travel time, crowding, accessibility, and robustness. A complete specification states the building and elevator group, the demand model, the grouping algorithm, the interface and accessibility provisions, fallback behavior when the system degrades, the evacuation boundary, and the performance metrics used for evaluation. It differs from conventional hall-call control, which only knows direction until a passenger is inside the car.

Scope of Application¶

Destination dispatch belongs to vertical transportation control and is useful where the analyst can specify the typed vertical transportation control carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics are explicit. The scope is broad within that domain but bounded by the need for the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Destination dispatch. Destination dispatch compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed vertical transportation control carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of vertical transportation control because they reuse the typed vertical transportation control carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Requests with compatible routes are clustered, a scheduling optimizer estimates the incremental cost of assigning each group to each car and a selected assignment is communicated before arrival., and type the carrier, state every parameter and convention in the definition, test that the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Destination dispatch Domain-specific

Parents (1) — outgoing typed relations

Destination dispatch is a kind of Allocation Prime

It remains its own entry because its identity is fixed by the building and elevator group, origin and destination requests, demand model, car state and capacity, assignment objective, grouping algorithm, user interface, accessibility, fallback, evacuation boundary and performance metrics.

Hierarchy path (1) — routes to 1 parentless root

Destination dispatch → is a kind of Allocation → presupposes Scarcity → is a decomposition of Constraint

Neighborhood in Abstraction Space¶

Destination dispatch sits in a moderately populated region (50^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Transport divide — 0.87
Liner shipping network design and scheduling problem — 0.86
Moving horizon estimation — 0.86
Automatic switched-transport network — 0.86
Traffic sign design — 0.85

Computed from structural-signature embeddings · 2026-10-25