Abstract
Elevator service in multistory buildings has been improved by the concept of banking. A building is split into two or more groups of contiguous floors, and each group of floors is served by a different set of elevators. This paper presents an optimization procedure based on dynamic programming for determining good banking arrangements. The algorithm has solved the combinatorial problem of deciding on the number of banks and cars, floor splits, and car speeds that has up to now faced the elevator industry. The algorithm has been reduced to a FORTRAN computer program that requires very little computer time.

This publication has 0 references indexed in Scilit: