基于ACO的集裝箱港口集卡作業(yè)調(diào)度優(yōu)化研究
[Abstract]:At present, with the continuous increase of population in our country, the per capita possession of land resources becomes less, which makes the land resources scarce. As a result, the state government has more and more strict restrictions on the port area. At present, all kinds of port development at home and abroad need to solve the problems of enhancing port handling capacity, tapping development potential and perfecting management system. In some developed countries, the management level of modern ports is much higher than that of domestic ones, for example, for ports of the same size, the throughput capacity of foreign countries is several times stronger than that of domestic ports. Through the equipment input increases, may speed up the container loading and unloading speed, but also will increase the cost input. Obviously, the improvement of container handling efficiency is very important, so it is very important to use scientific container port handling process to improve container handling efficiency. Container port card collection scheduling includes transportation and loading and unloading. At the same time, due to the increase of the number of container cards, the number of container ports, container port scale expansion and so on, these factors make card collection scheduling work become very complex. Therefore, how to improve the efficiency of port card collection is the necessary condition to improve the productivity of container port. In this paper, through the investigation of Tianjin Port (Group) Co., Ltd, we are familiar with and master the horizontal transportation process of Tianjin Port (Group) Co., Ltd, and collect the relevant data. Then, the function layout, operation resource and equipment configuration of container port are defined in combination with the actual situation. Ant colony genetic algorithm (AGA) theory and related data are used to determine the target of port horizontal transportation process optimization. Then, the optimization model of card scheduling for "job surface" is established. Finally, according to the actual operation situation of Tianjin Port and the relevant data design cases, the optimal scheduling mode and scheduling path are solved by using the Matlab optimization toolbox. Combined with container port horizontal transportation operation technology and ACO intelligent optimization algorithm, this paper provides a feasible and practical method for port enterprises at home and abroad, and provides the basis for optimizing horizontal transportation operation. The theoretical significance and practical function of this paper are as follows: (1) the theoretical system of improving and developing the container port horizontal transportation system in four aspects of: (l); (2) providing a feasible method for the perfection of China's container port horizontal process optimization; (3) by optimizing the horizontal transportation technology, the production efficiency of container port can be improved and the development of container port can be promoted. (4) solving the problems of container port horizontal transportation system and contributing to carrying out multimodal transport and realizing transportation modernization.
【學(xué)位授予單位】:武漢理工大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2014
【分類號】:F552
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 蒲興成;孫凱;;一種改進(jìn)的自適應(yīng)蟻群算法及其應(yīng)用研究[J];重慶郵電大學(xué)學(xué)報(自然科學(xué)版);2011年03期
2 黃立君;許永花;;遺傳算法和蟻群算法融合求解TSP[J];東北農(nóng)業(yè)大學(xué)學(xué)報;2008年04期
3 計明軍;劉豐碩;李郭記;靳志宏;;基于裝卸協(xié)同作業(yè)的集裝箱碼頭集卡調(diào)度及配置優(yōu)化[J];大連海事大學(xué)學(xué)報;2010年01期
4 孫力娟;王汝傳;;基于蟻群算法和遺傳算法融合的QoS組播路由問題求解[J];電子學(xué)報;2006年08期
5 計明軍;靳志宏;;集裝箱碼頭集卡與岸橋協(xié)調(diào)調(diào)度優(yōu)化[J];復(fù)旦學(xué)報(自然科學(xué)版);2007年04期
6 王超;;碼頭集卡運輸線路的模型研究及設(shè)計[J];港口科技;2009年11期
7 曾慶成;楊忠振;;集裝箱碼頭作業(yè)調(diào)度雙層規(guī)劃模型及求解算法[J];哈爾濱工程大學(xué)學(xué)報;2007年03期
8 李躍光;張遠(yuǎn)平;;一種改進(jìn)的蟻群算法在垃圾運輸問題中的應(yīng)用[J];湖南師范大學(xué)自然科學(xué)學(xué)報;2010年02期
9 尚晶;;面向雙40英尺岸橋的碼頭集卡調(diào)度模型與算法[J];華中科技大學(xué)學(xué)報(自然科學(xué)版);2010年11期
10 蔡光躍;董恩清;;遺傳算法和蟻群算法在求解TSP問題上的對比分析[J];計算機工程與應(yīng)用;2007年10期
本文編號:2410738
本文鏈接:http://sikaile.net/jingjilunwen/jtysjj/2410738.html