کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7541883 | 1489053 | 2017 | 26 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling optimization of yard cranes with minimal energy consumption at container terminals
ترجمه فارسی عنوان
بهینه سازی زمانبندی جرثقیل های حیاط با کمترین مصرف انرژی در پایانه های کانتینری
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
برنامه ریزی جرثقیل حیاط، برنامه ریزی عدد صحیح بهینه سازی، زمان چرخش جرثقیل، مصرف انرژی،
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
چکیده انگلیسی
This paper proposes a novel integer programming model to solve optimal problem of yard crane scheduling with minimal energy consumption at container terminals from the low carbon perspective. The traditional approaches for optimal crane scheduling focus only on crane moving distance without considering the total energy consumption of yard cranes. In this paper, an optimal model is built with consideration of such key factors as the crane moving distance, turning distance and the practical operation rules, which are directly related to the total energy consumption. In accordance with the general kind of handling system at container terminals in China, an integer programming model is proposed to optimize scheduling of yard cranes at container terminals with the purpose of minimizing the total energy consumption of the rubber-tyred gantry cranes. Then, on the basis of the actual operational data of the Shanghai Yangshan Deep Water Port (SYDWP), the container volume of each block is calculated and used to solve the model. Finally, computational experiments are proposed to illustrate and validate the solutions for yard crane scheduling.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 113, November 2017, Pages 704-713
Journal: Computers & Industrial Engineering - Volume 113, November 2017, Pages 704-713
نویسندگان
Mei Sha, Tao Zhang, Ying Lan, Xin Zhou, Tianbao Qin, Dayong Yu, Kai Chen,