探讨一种满足倒箱最少和作业高效的装载方案.docx

1、探讨一种满足倒箱最少和作业高效的装载方案 探讨一种满足倒箱最少和作业高效的装载方案1 集装箱码头装备的作业流程 The 1 container terminal equipment operation procedure集装箱的装备进程分为六步,详细如下: Equipment and process of container is divided into six steps, detailed as follows:第一步:断定装舱货品卸港的先后次第,后到港的集装箱放在舱内,先到港的集装箱后装或放在甲板上,装箱的进程中航次货运量不得大于航次净载分量,即货品总的装箱数量不能超越船只在当时港口能

2、装载的总箱数。第二步:顺次向舱内组织货品。按分舱的成果,向舱内装载货品,按卸港的次序和箱子的分量将集装箱组织到详细的箱位。第三步:核算稳性和总强度。依据船只数据资料及集装箱在船上的详细组织状况,核算船只关联的稳性和总强度数据。第四步:调整。依据稳性和总强度核算的成果对单个集装箱的方位进行调整,以确保满意稳性和总强度需求。第五步:预配。预配也称为安置配载,首要是将装载港的集装箱按货品类型、尺度及目的港组成同类箱组,依据必定的预配准则和优化方针将其分配到船只的不一样Bay位上,断定集装箱在船上的纵向装载方位,完结集装箱在船上的整体安置。第六步:Bay位排箱。Bay位排箱首要是在预配的基础上,断定单

3、个集装箱在船上Bay位中的详细方位,首要思考箱子的尺度、分量,船只的稳性及倒箱等要素,断定集装箱沿船只纵向和横向的合理散布,它将影响船只的GM、横倾及改变强度。 The first step : to determine loading goods unloading port order, to the port container placed in the cabin, the first port container after loading or on deck, voyage freight packing process shall not be greater than th

4、e net load component that voyage, the total number of packing goods cannot surmount the ships in the port to total box at the number of loading. The second step: in order to cabin organization of goods. According to the results of the subdivision, loading goods according to the cabin, the discharge

5、port order and box component of the container to detailed case. The third step: the calculation stability and total intensity. Based on the detailed organization of ship data and container ships, stability and total intensity data calculation of ship association. The fourth step: adjust. Adjusted ac

6、cording to the orientation stability and strength calculation results of individual containers, in order to ensure satisfactory stability and strength demand. The fifth step: provisioning. Provisioning is also known as the placement of stowage, first is the container loading port the goods type, siz

7、e and destination component similar box group, on the basis of certain policy criterion and optimization with the assigned to the vessel is not the same as Bay, concluded that the container in the ships longitudinal load range, the end of container placed on ships the overall. The sixth step: Bay la

8、yout. Bay layout is mainly based on prewired, concluded that a single container on board Bay detailed range in scale, components, primary reflection box, ship stability and inverted box and other factors, decided that container ships along the longitudinal and transverse reasonable distribution, it

9、will affect the GM ships, transverse inclination and the change of strength.详细的集装箱船每航次通常都要停靠多个半途港进行货品装卸,配载时应归纳思考货品性质、船只到港次序、货品分量、装卸作业条件,应确保半途港货品顺畅卸出及半途港货品装卸后的船只功能,详细配载算法可思考以下启发式规矩:成组指使技能将集装箱按货品类型、集装箱尺度、到港次序予以归类,同一特点的货品组成同类箱组;以箱组为单位别离在船上挑选相应方位。当货品特点不一样时,先格外后通常将货品按类型划分为风险货品、冷藏货品及一般货品.在配载时,应首要挑选风险货品及冷藏

10、货品的铺位,然后依据具本状况恰当组织一般货品的铺位。Details of the container ship each voyage usually docked a plurality of Midway port cargo loading, stowage should consider the product properties, ship arrivals, order goods component, loading and unloading conditions, should ensure that the port of unloading goods halfway

11、smooth and midway port cargo loading after ships, with loading algorithm can consider the following heuristic rules. : group directs ability will container goods, according to the type of container port in order to scale, categorize, the same characteristics of the goods component similar box to box

12、 group; group unit were selected corresponding range on the boat. When the goods have different characteristics, especially after the first will usually be classified by type of goods for goods risk, refrigerated goods and general goods. In the cargo, should be the first selection of risk of goods a

13、nd refrigerated goods shops, then according to the condition of proper organization general cargo berth.2 装备进程的数学函数和束缚条件 Mathematical function and restraint conditions 2 equipment process配载抵达的需求为满意必定束缚条件下最大体积装载率或分量装载率,以进步集装箱的运用率,取得最佳效益。装箱的方针可描绘为其间:n为货品数;k为集装箱数;li,wi,hi,gi别离表明货品的长、宽、高和质量;Lj,Wj,Hj,Mj别

14、离表明集装箱的矿车长、宽、高和最大装载质量.货品装载时有必要需求:货品平行于集装箱的边放置;货品不能彻底悬空,放置在上层的货品有必要与基层货品有触摸。 Stowage in demand for satisfy certain constraints the maximum volume loading rate or component loading rate, rate of progress in the container, and get the best benefit. The packing can be described as: n policy during the g

15、oods number; K as the number of containers; Li, WI, hi, GI showed that the goods long, wide, high and quality; Lj, Wj, Hj, Mj show that the largest container long, wide, Taka Wa loaded quality. The goods loading necessary requirements: parallel to the container goods placed; goods can not be complet

16、ely suspended, placing necessary and primary goods in the goods have touch.装备的详细束缚如下:束缚一:集装箱重心方位的束缚。为了使集装箱在运送进程中坚持平衡,对集装箱的重心方位有必定的需求,即实践重心与集装箱的几许中间的间隔不能超越必定的间隔(D)。束缚二:集装箱单箱分量束缚。为了便于运送与转移,集装箱单箱分量不超越上限。束缚三:货品放置次序束缚。实践装载进程中尽量做到“大不压小,重不压轻”准则,即货品放置的层有必定的束缚。束缚四:货品摆放方位束缚。集装箱长、宽、高均为L、W、H标准,优化方针为集装箱的空间运用率最高,

17、即对一批固定的货品进行转载,使选用集装箱的数量最少。 The detailed binding equipment are as follows: the bound: container gravity range. In order to make the container to keep balance in the delivery process, have a certain demand for the center of gravity position container, namely the practice of center of gravity and the c

18、ontainer of many intermediate interval cannot be beyond a certain distance ( D ). Two: container components. In order to facilitate the transport and transfer, container component does not exceed the upper limit. Bound three: goods placed order. The practice of big pressure small loading do not try

19、to process, heavy not pressure light criterion, i.e. goods placed layers have a certain bound. Four: goods display range bound. Container long, wide, high are L, W, H, optimization principle for the space of the container using the highest rate, which is reproduced on a fixed number of goods, so tha

20、t the selection of the least number of container.3 根据忌讳查找算法的求解办法 3 according to the solution taboo search algorithm忌讳查找引入了人工智能的回忆机制,格外关于一些复杂问题,显示出极强的寻优才能。忌讳指的是制止重复前面的操作。为了避免查找堕入有些最优,用一个叫忌讳表的布局记录下现已抵达过的有些最长处,鄙人一次查找中,运用忌讳表中的信息不再或有挑选地查找这些点,以此来跳出有些最长处,一起“忘记”又使忌讳在必定时刻后失效,结尾抵达大局优化。咱们运用DBSTree的算法来完成这一思维,详细

21、的操作如下: Taboo search into the memory mechanism of artificial intelligence, especially for some complex problems, shows strong optimization ability. Taboo refers to avoid repeat operation. In order to avoid looking into some optimal layout, with a record called taboo table now arrive at some of the mo

22、st strength, the next search, using the information in the table is no longer taboo or selected to find these points, in order to jump out of some of the strengths of forget , together and make failure in a certain time taboo after the end of the overall optimization, arrived. We use the DBSTree alg

23、orithm to accomplish this thinking, the detailed operation are as follows:Step1:初始化箱子容量、箱子标号、物品数量及各物品所占空间; Step1: initialization box, label, box capacity number of items and the item space;Step2:以箱子容量为关键值结构DBSTree,并为每个结点标号; Step2: in the case of capacity for the key structure of DBSTree, and for eac

24、h node label;Step3:顺次装载每个物品,若是物品的尺度大于容量最大的箱子,则将物品拆分,先将超尺度物品装入当时容量最大的箱子中,若是拆分后物品的剩下有些还大于箱子的容量,则持续拆分,不然转Step4。 Step3: are sequentially loaded each item, if goods scales larger than the capacity of the largest box, the article split, the ultra scale items in the capacity of the largest box, if the rema

25、ining after the split goods some larger than the capacity of the bins, continued to split, or Step4.Step4:查找:寻觅最优匹配的箱子,假定该物品所占的空间为s1,寻觅大于等于量的关键值:首要从根开端,若是根为空,那么查找树不包括任何关键值,查找挫折,则将丑与根的关键值相比较。 Step4: search: search for optimal matching box, assuming that the object space is S1, looking for the key val

26、ue is greater than or equal to the amount of root: mainly from the beginning, if the root is empty, then the search tree does not include any key value, find the setback, the ugly key and root compared.Step5:刺进:若是箱子未被装满,则以箱子的剩下空间更新箱子容量,假定箱子的剩下空间为e,则首要经过查找二叉树来断定要刺进的值e的方位,若是查找不成功,新元素刺进到查找的中断点,转Step7:

27、Step5: Pierce : if the box is not full, the box left spatial updating box capacity, if a box left space for the E, is mainly through the two search tree to determine to pierce the values in the e range, if the search is unsuccessful, new elements pierce to find the break point, Step7:Step6:删去:若是箱子已被

28、装满,则从树中删去最优箱子,分三种状况: Step6: if the box has been filled out, from the tree by deleting the optimal case, is divided into three kinds of situation:Case1:要删去的节点t是树叶:丢掉树叶结点; The node T Case1: to delete the leaves: lose the leaf nodes;Case2: 要删去的节点f只要一个非空子树:若是t没有父结点,则将t丢掉,t的仅有子树的节点成为新的查找树的根节点;若是t有父结点node

29、f,则修正node的指针,使得node指向node的仅有孩子,然后删去节点node。 Case2: to delete the node F as long as a nonempty tree: if the T has no parent node, the subtree nodes only lost t, t becomes the new root node search tree; if the T parent node F, pointers are modified node, only children make node to node, then deleting t

30、he node node.Case3: 要删去一个左右子树都不为空的节点中的元素,将该元素替换为它的左子树中的最大元素或右子树中的最小元素。 Case3: to delete a left subtree are not empty nodes in the element, the element with the smallest element maximum element its left subtree of or the right subtree.Step7:一切物品都被装载了吗?若是是,转Step8;不然转Step3: Step7: everything has been loaded? If it is, Step8; or Step3:Step8:输出所用箱子个数、总容量及装箱成果,完毕。The box number, total capacity and packing results with the Step8: output,.