An application of branch-and-bound method to deterministic optimization model of elevator operation problems

In this paper, we propose a framework for obtaining the optimal solution of an elevator operation problem by applying branch-and-bound method, where it is assumed that all information about the passengers are given. The problem is solved by determining the assignments of passengers to elevators and the processing order of passengers for each elevator. The validity of an existing rule to decide a car service is examined by comparing the results with the optimal one.