Scribd
Upload
62 views

Justification For Using Elevator Algorithm

The document describes an algorithm for designing an elevator controller that can service requests on any number of floors. The elevator algorithm is selected, which serves all requests in one direction before reversing. This is more efficient than other algorithms as it addresses the disadvantages of shortest seek first, by serving requests in order of direction rather than proximity, and first come first serve, by being more energy efficient with fewer direction changes. The high-level design simulates an efficient elevator system through optimally assigning requests to individual elevators based on factors like current requests and travel distances.

Uploaded by

prateeks1990
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
62 views

Justification For Using Elevator Algorithm

The document describes an algorithm for designing an elevator controller that can service requests on any number of floors. The elevator algorithm is selected, which serves all requests in one direction before reversing. This is more efficient than other algorithms as it addresses the disadvantages of shortest seek first, by serving requests in order of direction rather than proximity, and first come first serve, by being more energy efficient with fewer direction changes. The high-level design simulates an efficient elevator system through optimally assigning requests to individual elevators based on factors like current requests and travel distances.

Uploaded by

prateeks1990
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

To design an Elevator controller for any number of floors.

Algorithm:

There are different algorithms that could be used for designing the elevator controller.
The important one's are:

1. elevator algorithm::
Serve the entire request in one direction and then reverse the direction.
2. shortest seek first
Serve the request closest to the present floor
3. first come first serve
Serve requests as they arrive.
We have used ELEVATOR ALGORITHM.

Justification for using elevator algorithm


1. Disadvantages of shortest seek first:
Irrespective of the time at which request is placed, it only caters to the request
closest to the present floor.
e.g. If someone places a request for 100th floor
there are lots of other requests for nearby floor as it is a busy place
also if they keep coming .
then that person's request is not at all catered to for a long time .
2. Disadvantages of first come first serve basis
e.g. Inefficient as far as power requirements are concerned
also more time will be taken on an average to reach the required destination.
The elevator algorithm takes care of these two shortcomings by catering to the request in
it's direction then reverses direction when we reach top floor or there are no more request
for the upper floors ;the same is repeated for the downward direction .

The essence of our project is the high-level design.  Our goal to simulate an efficient
elevator system, designing the logic produce desirable results will be a challenge. The
best way to control separate elevators is to have each elevator respond optimally to any
given set of requests (to pick up or drop off passengers).  We can then write an algorithm
that would predict which elevator could respond the fastest to a passenger request and
assign the request to that elevator.  While our physical elevator system will consist of few
floors, the design can be scaled to any number of floors. 

The elevator starts at level 1. It opens the door for 5 s, then checks for requests in upper
levels. The movement from one level to another is represented by a timer. The transition
between two successive levels takes 8 s. As soon as a request is serviced, the door opens
for 5 s to take passengers in, and then proceeds to the next request to be serviced.
Whenever a level is passed by, its light flashes for 1 s to indicate the current position of
the elevator on its way to its required destination. The requests whose direction (up or
down) is similar to the current direction of the elevator are always serviced before those
made in the opposite direction, regardless of which requests were made first. The system
continues to service all the remaining requests in a similar way. Whenever no more
requests are left to service, the elevator will simply remain at the level it was last at,
keeping the door open for 5 s and then closing it until a fresh request is made.

Delegating Requests

In order to control our system of three elevators efficiently, we had to come up


with a way to appropriately assign requests to each elevator.  Assigning requests
from the inside button pushes was trivial, as an elevator must respond to its own
inside buttons.  For each outside button pushed, only one elevator receives the
request.  Our algorithm to assign requests favors the elevator with the fewest other
requests in order to split traffic evenly among the elevators and minimize time
spent waiting to get off.  In the case where two or more elevators have the same
number of other requests, we compute the worst-case distance that each one must
travel to answer the request.  The three scenarios are explained below. 

 
Case 1:  In this case, the elevator is traveling towards the floor that the request is
on in the same direction that the request is in.  The worst-case distance (maximum
number of floors) between the elevator and the request is just:

|requestFloor – currentFloor|

Where requestFloor is the floor that the request is on and currentFloor is the floor
that the elevator is currently on.

Case 2:  In this case, the elevator is traveling in the opposite direction that the
request is in.  The worst-case distance between the elevator is the distance from
the elevator to end of the shaft in its current direction of travel plus the distance
from the end of the shaft back to the request floor.  So, if the elevator is traveling
upward, the distance is:

(floors-1-currentFloor)+(floors-1-requestFloor)

If the elevator is traveling downward, the distance is:

currentFloor + requestFloor

Where floors is the number of floors in the elevator system.

 Case 3:  In this case, the elevator is traveling away from the floor in the same
direction that the request is in.  The worst-case distance is:

2*(floors – 1) – |requestFloor – currentFloor|.

In this paper, the successful design and implementation of the intelligent


control of a 4-level elevator system using only a small educational PLC was
discussed. The design includes a simple scheme that aims at a good
compromise between energy consumption and speed of response.

You might also like