Allocating destination calls using genetic algorithm employing chromosomes

US10183836B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10183836-B2
Application numberUS-201514956037-A
CountryUS
Kind codeB2
Filing dateDec 1, 2015
Priority dateJun 11, 2013
Publication dateJan 22, 2019
Grant dateJan 22, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method of assigning destination call in an elevator group forms chromosomes including genes where each gene is a correlation of a call and an elevator trip, the possible round trips are calculated, each round trip is evaluated for optimization procedure. The calls are assigned to the elevators by the destination call control based on the best chromosome determined.

First claim

Opening claim text (preview).

The invention claimed is: 1. Method for handling destination calls in an elevator group comprising several elevators using destination call control, which method comprises an allocation procedure for situations where the calls can't be served by all elevators of the elevator group in one round trip, in which situation “n” open calls and “m” fixed calls are present, which fixed calls are already allocated but not served, in which allocation procedure comprises: a) forming chromosomes comprising genes in which chromosomest, n first genes comprise a correlation of each open call and a corresponding elevator, n second genes comprise a correlation of each open call and the corresponding number of the round trip in which the open call will be served, and m third genes comprise a correlation of each fixed call and the corresponding number of the round trip in which the fixed call will be served, b) calculating for each chromosome round trips for each elevator of the elevator group according to collective control, c) evaluating the round trips of all elevators calculated in step b) according to known optimization criteria, d) presenting chromosomes evaluated in step c) as sufficient to the forming of a new generation by per se known genetic algorithm (“GA”) methods, e) repeating the steps b) to d) for each chromosome of each new generation of chromosomes until a stop criterion is achieved, f) wherein the calls are served in collective control according to the best chromosome of the last generation, and g) assigning the destinations of each elevator in its travelling direction in the current round trip according to the best chromosome to allow them to be shown on at least one common display shortly before each elevator's arrival at said landing. 2. Method according to claim 1 , wherein with the issuing of a destination call via a destination operation panel (DOP) the passenger is referred by said panel to a common display of the landing. 3. Method according to one of the preceding claims, wherein no immediate call allocation is made after the issuing of a destination call. 4. Method according to claim 1 , wherein after the issuing of a destination call, the elevator is immediately allocated. 5. Method according to claim 4 , wherein the passenger is referred to a common elevator display located adjacent the landing door of the allocated elevator. 6. Method according to claim 1 , wherein the maximal number of round trips is limited to three. 7. Method according to claim 1 , wherein the elevator systems does not accept car calls in an overcapacity situation. 8. Method according to claim 1 , wherein as the common display one common display in the center of the elevator lobby of each landing is used. 9. Method according to claim 1 , wherein as the common display common elevator displays beside the landing door of each elevator are used. 10. Method according to claim 2 , wherein the maximal number of round trips is limited to three. 11. Method according to claim 3 , wherein the maximal number of round trips is limited to three. 12. Method according to claim 4 , wherein the maximal number of round trips is limited to three, particularly to two. 13. Method according to claim 5 , wherein the maximal number of round trips is limited to three, particularly to two. 14. Method according to claim 2 , wherein the elevator systems does not accept car calls in an overcapacity situation.

Assignees

Inventors

Classifications

  • Periodic re-allocation of call inputs · CPC title

  • Details of the evaluation method for the allocation of a call to an elevator car · CPC title

  • Cross-Sectional Technologies · mapped topic

  • Waiting time, i.e. response time · CPC title

  • Total time, i.e. arrival time · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10183836B2 cover?
A method of assigning destination call in an elevator group forms chromosomes including genes where each gene is a correlation of a call and an elevator trip, the possible round trips are calculated, each round trip is evaluated for optimization procedure. The calls are assigned to the elevators by the destination call control based on the best chromosome determined.
Who is the assignee on this patent?
Kone Corp
What technology area does this patent fall under?
Primary CPC classification B66B1/2466. Mapped technology areas include Operations & Transport.
When was this patent published?
Publication date Tue Jan 22 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).