A LAGRANGIAN RELAXATION-BASED ALGORITHM FOR THE ALLOCATION OF YARD CRANES FOR YARD ACTIVITIES WITH DIFFERENT PRIORITIES

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of systems science and systems engineering Vol. 22; no. 2; pp. 227 - 252
Main Authors: Zhang, Canrong, Wu, Tao, Zheng, Li, Miao, Lixin
Format: Journal Article
Language:English
Published: Heidelberg SP Systems Engineering Society of China 01.06.2013
Springer
Springer Nature B.V
Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ 85040, U.S.A.%Department of Industrial Engineering, Tsinghua University, Beijing 10084, China%Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Branch and bound methods
Complexity
Computer science; control theory; systems
Economic Theory/Quantitative Economics/Mathematical Methods
Engineering
Exact sciences and technology
Gantry cranes
Ground, air and sea transportation, marine construction
Heuristic
Integer programming
Marine and water way transportation and traffic
Mathematical programming
Mixed integer
NP-hard
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Priorities
Theoretical computing
业务分配
优先级
启发式算法
堆场
拉格朗日松弛算法
混合整数规划模型
龙门起重机
Crane allocation
container terminal
sub-gradient
Lagrangian relaxation
yard crane
Program library
Branch and bound method
Priority
Port terminal
Competitiveness
Gantry crane
Software package
Activity
Mixed integer programming
Crane
Computational complexity
Modeling
Lagrange multiplier
Rail
Heuristic method
NP hard problem
Container transportation
Relaxation method
ISSN:1004-3756, 1861-9576
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:Crane allocation, container terminal, Lagrangian relaxation, sub-gradient, yard crane
11-2983/N
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.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1004-3756
1861-9576
DOI:10.1007/s11518-013-5215-8