The Static Elevator Dispatching Problem with Destination Control

The Elevator Dispatching Problem with Destination Control (EDPDC) is a combinatorial optimization problem that has received little attention in the literature. In destination control, passengers declare their destination floor in the lobby by making a call before entering the elevator and the user interface assigns them an elevator. The EDPDC is a dynamic problem where passengers arrive at unknown times, get picked up at their origin and dropped off at their destination floor. Generally, the objective is to minimize the average passenger waiting time. In this chapter, we introduce the multi-objective static Elevator Dispatching Problem with Destination Control. We consider perfect information about future passenger arrival times, origin floors and destination floors. We present a network flow formulation and perform true multi-objective optimization with two objectives: the average journey time of passengers and the total energy consumption of the elevator group. We solve small instances to study the sensitivity of the problem to various parameters. We show that significant energy savings are possible with a small increase of the average journey time.