Prioritised A* search in real-time elevator dispatching

Prioritised A* search in real-time elevator dispatching Under the typical operating conditions of an elevator system, there is insufficient time to consider all dispatching alternatives and the major elevator companies normally adopt empirical techniques to reduce complexity and achieve acceptable performance. The current work has been able to demonstrate that in practical circumstances an optimal solution to the real-time elevator-dispatching problem can be obtained. The elevator dispatching problem is formulated as a heuristic search and is implemented using a novel extension of the popular A* search, termed prioritised A*, that retains the desirable admissibility and monotonicity of A*. PA* makes best use of the limited time available by ensuring the dispatcher considers the most important aspect of the problem first, namely to give each elevator its first assignment. In a manufacturing process, this is equivalent to ensuring that each machine is immediately given its first job, while the determination of the detailed order of the remaining jobs is refined later. This study has obtained access to extensive data records collected from installed elevator systems and their analysis has led to the identification of new passenger models able to deliver suitable high quality predictive data to improve the operations of the dispatcher. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Control Engineering Practice Elsevier

Prioritised A* search in real-time elevator dispatching

Loading next page...
 
/lp/elsevier/prioritised-a-search-in-real-time-elevator-dispatching-9fvGoNRtBw
Publisher site
See Article on Publisher Site

Abstract

Under the typical operating conditions of an elevator system, there is insufficient time to consider all dispatching alternatives and the major elevator companies normally adopt empirical techniques to reduce complexity and achieve acceptable performance. The current work has been able to demonstrate that in practical circumstances an optimal solution to the real-time elevator-dispatching problem can be obtained. The elevator dispatching problem is formulated as a heuristic search and is implemented using a novel extension of the popular A* search, termed prioritised A*, that retains the desirable admissibility and monotonicity of A*. PA* makes best use of the limited time available by ensuring the dispatcher considers the most important aspect of the problem first, namely to give each elevator its first assignment. In a manufacturing process, this is equivalent to ensuring that each machine is immediately given its first job, while the determination of the detailed order of the remaining jobs is refined later. This study has obtained access to extensive data records collected from installed elevator systems and their analysis has led to the identification of new passenger models able to deliver suitable high quality predictive data to improve the operations of the dispatcher.

Journal

Control Engineering PracticeElsevier

Published: Feb 1, 2007

References

  • A formal basis for heuristic determination of minimum cost paths
    Hart, P.E.; Nilsson, N.J.; Raphael, B.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off