Research On Technologies Of Block Erection Sequence Optimization On The Berth Based On Improved Ant Colony Algorith

The development of marine industry for has important strategic significance to the national defense and maritime sovereignty. Meanwhile it provides a strong technical support for maritime transport and marine resources exploration. At the beginning of2010, China, a maritime kingdom, is not only the best one among the whole shipping, but also ranks first in the world ship building industry. During the Twelfth Five-Year Guideline period, the global pattern of economic benefits always changes. The competition of the ship market is fierce. Therefore how to improve shipbuilding efficiency is one of the key challenges for each shipyard to deal with the fierce competition. Block erection on the berth is an important part of ship construction and berth (dock) is irreplaceable shipyard facilities and resources. We can even say the number and size of berth (dock) can directly reflects the shipyard production capacity. So, through the berth (dock) lifting optimization program the berth (dock) resource utilization can be improved, which plays a significant role in shorten the berth period.The problem of berth erection sequence optimization is a typical NP problem, It is difficult to obtain the best solution just by artificial experience. Concerning this, in this easy, ant colony optimization algorithm (ACO) based on resource-constrained project scheduling problem(RCPSP) theory is used to study following aspects of the berth erection order optimization problem.The author first makes a detailed review and a comprehensive discussion of berth erection of dynamic scheduling problems and RCPSP at home and abroad. After making the detailed study and a comprehensive discussion of ACO basic principles, the algorithm is improved combining with berth erection characteristics in order to make it to solve the problem successfully.Frame and function of block erection dispatching system on the berth is given and data structure of block information and hoisting network diagram is analyzed.Under multiple resource constraint conditions, based on RCPSP limited resources-the shortest duration model, mathematical Model of a single ship berth boat lifting and hoisting multiple problems is constructed combining berth erection sequence optimization features. Also, the model optimization method of the improved ant colony algorithm was given.Finally, improved ant colony algorithm is applied to optimize a single vessel and multi-vessel hoisting of Dalian shipyard, proposing the shortest duration and optimal lifting plan and analyzing the resource allocation and optimizing the algorithm to find out that it is reasonable and feasible using this method to optimize berth lifting order.