کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1135141 956090 2009 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The optimum route problem by genetic algorithm for loading/unloading of yard crane
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
The optimum route problem by genetic algorithm for loading/unloading of yard crane
چکیده انگلیسی

In recent years, the scale of container transportation and the size of vessels are becoming larger and larger; development of automatic container cranes becomes a necessity. As a key function of automatic control of unmanned cranes, the optimum route can minimize the cycle time by calculating the most efficient combination of horizontal and vertical motions of container loading/unloading. In this study, we have comprehensively studied various issues in the route planning in different fields. Later, the mathematical model based on the problem analysis of loading/unloading process was presented. Particularly, to solve the problem, an optimum route method based on genetic algorithm, which satisfies the criteria such as length, smooth degree and safety distance, was developed. Finally, the computational experiments testified the effectiveness of the algorithm and explored a new way to increase the efficiency of container loading/unloading process.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 56, Issue 3, April 2009, Pages 993–1001
نویسندگان
, , ,