By Topic

An application of branch-and-bound method to deterministic optimization model of elevator operation problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Inamoto, T. ; Graduate Sch. of Sci. & Technol., Kobe Univ., Japan ; Tamaki, H. ; Murao, H. ; Kitamura, S.

In this paper, we propose a framework for obtaining the optimal solution of an elevator operation problem by applying branch-and-bound method, where it is assumed that all information about the passengers are given. The problem is solved by determining the assignments of passengers to elevators and the processing order of passengers for each elevator. The validity of an existing rule to decide a car service is examined by comparing the results with the optimal one.

Published in:

SICE 2002. Proceedings of the 41st SICE Annual Conference  (Volume:2 )

Date of Conference:

5-7 Aug. 2002