Routing straddle carriers for the loading operation of containers using a beam search algorithm

Routing straddle carriers for the loading operation of containers using a beam search algorithm

0.00 Avg rating0 Votes
Article ID: iaor2000187
Country: Netherlands
Volume: 36
Issue: 1
Start Page Number: 109
End Page Number: 136
Publication Date: Jan 1999
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: transportation: general
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.

Reviews

Required fields are marked *. Your email address will not be published.