Title: +038=621.001-NI001T_02-Nexiez-MRL.pdf
Cooperative Optimization Assignment (∑AI-2200C) When a hall call is registered, the algorithm assumes a near-future calls that could require long waits. Through evaluation of the registered hall call and the forecasted call, the best car is assigned. All cars work cooperatively for optimum operation.CarCar callHall callTraveling directionEle. No.Ele. No.AI-2100N (Conventional system) [A hall call is registered at 6th Fl.] Allocates the closest car B. [Another hall call is soon registered at 11th Fl.] Allocates D, resulting in long wait of 26 sec.ΣAI-2200C (New) [A hall call is registered at 6th Fl.] Allocates D, which is moving upward. [Another hall call is soon registered at 11th Fl.] Allocates B, which immediately arrives at the floor.Allocating Passengers to Cars Depending on Destination Floors