کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9663636 | 1446235 | 2005 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm](/preview/png/9663636.png)
چکیده انگلیسی
In this study we consider the elevator operation problem of single-car elevator systems with destination hall call registration. In this part we construct a branch-and-bound algorithm to solve the dynamic operation optimization problem formulated in the first part. To calculate lower bounds of the subproblems generated in the course of the branch-and-bound algorithm, we first relax some of the constraints of the subproblems and decompose the relaxed subproblems into three parts. Then, we apply the Lagrangian relaxation method to the decomposed subproblems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 167, Issue 2, 1 December 2005, Pages 574-587
Journal: European Journal of Operational Research - Volume 167, Issue 2, 1 December 2005, Pages 574-587
نویسندگان
Shunji Tanaka, Yukihiro Uraguchi, Mituhiko Araki,