集装箱堆场问题的一个数学模型及算法 英语论文.docVIP

A model and its algorithm on container yard problem Abstract: There is a problem in container yard, a series of containers is transformed to t he gate of yard waiting f or being assigned a location. T he containers are stacked in three with the lighter below and t he heavier above in order that the lighter container is above when loading t he ship. For the random of arrivals of the containers, it is inner it able to shift containers ( if a lighter container is above a heavier one, then we move the lighter aside to load the heavier, t hen load t he lighter) . How to as-sign a location to t he container to minimize the number of shifting containers maybe a NP problem. There is no precise solution. So we give a heuristic algorithm to the solution. Keywords :Yard; Number of container- shifting AMS: O1773 1 Introduction A ship depart s, t he containers of the ship are sent to t he container wharf which is called / collect ion0. All containers of the same ship are stacked up in the same yard. We are required to pile t he containers three in a stack and load the heavier, then load the lighter. This is called / shifting . The numbers of shifting can lower the loading speed, prolong the parking time, so influence the working efficiency. In order to reduce the rate of shifting, we find a method to assign the locations for a group of containers. 2 Constructing a model According to the yard problem, we construct a mat hermetical model. For a sequence of n containers with a weight number, we pile them up three in one stack one above another. T hen the number of stacks is k = n/3 n is integer times of 3 k = n/3+1 n is not integer times of 3 We let the lighter container above and the heavier below. T he container with the same number can be piled up in one stack . So the there weight numbers of one stack make a sequence from the bottom t o top. There is an inverse number for every stack. T he problem becomes that how to as-sign a location t o every container so tha