پديدآورندگان :
Azaria Esmaeel Industrial Engineering Deptartment, Faculty of engineering, Tarbiat Modares University, Tehran, Iran , Eskandaria Hamidreza Industrial Engineering Deptartment, Faculty of engineering, Tarbiat Modares University, Tehran, Iran , Nourmohammadia Amir a.nourmohammadi@modares.ac.ir Industrial Engineering Deptartment, Faculty of engineering, Tarbiat Modares University, Tehran, Iran
كليدواژه :
Container terminal , container retrieval problem , heuristics , branch and bound
چكيده فارسي :
In this study, an efficient heuristic for the container retrieval problem is proposed. Given the initial layout of a container terminal with a bay, this problem aims at obtaining a movement sequence for the crane to retrieve all the containers arranged in a specified order. To this purpose, a computationally efficient heuristic, called constant summation (CSUM), is developed to minimize the total crane s working time required to retrieve all the containers from a given bay. Numerical results show that the CSUM is very promising compared to the best known approaches recently presented in the literature.
