Routing straddle carriers for the loading operation of containers using a beam search algorithm |
| |
| Affiliation: | 1. Water Resources and Remote Sensing Laboratory, Dept. of Water Resources, Graduate School of Water Resources, Sungkyunkwan University, Suwon 440-746, Republic of Korea;2. Department of Civil and Environmental Engineering, University of Maryland, College Park, Maryland, USA;3. School of Civil, Architectural and Environmental System Engineering, Sungkyunkwan University, Republic of Korea;1. Department of Electronic Systems, Norwegian University of Science and Technology, 7491 Trondheim, Norway;2. Department of Geoscience and Petroleum, Norwegian University of Science and Technology, 7491 Trondheim, Norway;3. Department of Geoscience and Engineering, Delft University of Technology, 2628CN Delft, the Netherlands |
| |
| Abstract: | This paper discusses how to route straddle carriers during the loading operation of export containers in port container terminals. The objective of the routing is to minimize the total travel distance of straddle carriers in the yard. The routing problem is comprised of the container allocation problem and the carrier routing problem. In the container allocation problem, containers in the yard are divided into multiple classes, each of which will be loaded by a quay crane. The container allocation problem is formulated as a transportation problem. In the carrier routing problem, the sequence of yard-bays that a carrier visits is determined. A beam search algorithm is developed for the carrier routing problem. A numerical experimentation is carried out in order to evaluate the performance of the algorithm. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
