Abstract
In this paper, we propose a framework for obtaining the optimal car service to elevator operation problems by applying a branch-and-bound method based on the deterministic optimization model. In designing the model, it is assumed that the movement of cars and passengers synchronized with discrete time, and all passengers arriving to the hall is known beforehand. The assignment of passengers to cars and the processing order of the services to passengers are taken as decision variables in designing a branch-and-bound solution. In the computational experiments, the Call-Dispatching and Selective-Collective rule is taken as a typical rule and the results obtained by using this rule and those by the branch-and-bound method are compared and examined.
