A Branch and Bound Method to the Continuous Time Model Elevator System with Full Information

Abstract

A new Branch and Bound method is given for the scheduling of the group elevator system with full information. Full information means that not only the parameters of the elevator systems but also the arrival time, origins and destinations of all the passengers who are to be served are known beforehand. The performance obtained by solving the full information problem is the best performance that the elevator scheduling algorithm can achieve and then can be used to measure how good an elevator scheduling algorithm is. The method can handle the continuous time event and is based on the concept of "trip", which refers to the movement of the car without changing the direction and with at least one passenger being served.

Proposal and Progress of a Road-map to Bridge Theoretical and Practical Approaches for Elevator Operation Problems

“…One of the authors have tackled to the EOP from 2002, and have published a survey paper in Japanese at 2012 [10]. There are some academic studies [11,12,13,14] which have treated the EOP as optimization problems. Especially, the optimal operation rule for the up-peak traffic pattern was displayed in [14], whereas that rule requires such unavailable information as the arrival rate of passengers.…”

“…Especially, the optimal operation rule for the up-peak traffic pattern was displayed in [14], whereas that rule requires such unavailable information as the arrival rate of passengers. Other studies have no guarantee to yield optimal solutions, due to the incomplete formulation [12], the utilization of the receding horizon approach [11], and the utilization of the genetic algorithm [13]. One of the authors made it possible to yield optimal solutions for the deterministic and stochastic EOPs by deploying the integer linear programming [4,16] and the dynamic programming [15], respectively.…”

Optimization of Group Elevator Scheduling With Advance Information

“…To demonstrate the near-optimality of solutions, our method (HNPGA) will be first compared with a trip-based branch and bound (BB) method which can generate optimal solutions [35]. The new door action control method is used in both methods.…”