期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A LAGRANGIAN RELAXATION-BASED ALGORITHM FOR THE ALLOCATION OF YARD CRANES FOR YARD ACTIVITIES WITH DIFFERENT PRIORITIES
1
作者 Canrong ZHANG Tao WU +1 位作者 Li ZHENG Lixin MIAO 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2013年第2期227-252,共26页
This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features... This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features of this kind of gantry cranes, such as a restricted traveling range and a limited number of adjustments during loading and discharging operations. In contrast to most of the literature dealing with these four yard activities individually, this paper models them into an integrated problem, whose computational complexity is proved to be NP-hard. We are therefore motivated to develop a Lagrangian relaxation-based heuristic to solve the problem. We compare the proposed heuristic with the branch-and-bound method that uses commercial software packages. Extensive computational results show that the proposed heuristic achieves competitive solution qualities for solving the tested problems. 展开更多
关键词 crane allocation container terminal Lagrangian relaxation sub-gradient yard crane
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部