Research On Port Logistics Problem Based On Ant Colony Optimization Algorithm

With the development of international trade and economic globalization, container loading problem (CLP) and the berth allocation problem (BAP) with time window become problems which need resolve urgently of port logistics.Container loading problem is a process that put goods of different kinds, which have certain size, volume and number, in the space of container having certain volume and loading capacity restraint, it belongs to the space source optimization problem with several constraints. Because packing optimization can increase container's utilization ratio and decrease transport cost, the corporation profit is improved. As well, the research results can be applied to space source optimization problems such as plane hold loading, ship hold loading, even the distribution of computer memory. With the port's competitiveness becoming fiercer, the high efficiency use of the port resources has affected economic and social benefits of ports. Berth is the most important resources, the length of parking time in the port affects customer satisfaction and port passing rates directly, so that the port obtains higher profits. So improving the utilization of berths can help port gain higher profits. For container loading problem and berth allocation problem, the research contents in this paper included mainly several aspects as follows:1. This paper summarized the background and the investigative statues at home and abroad of container loading problem and berth allocation problem. At the same time, the paper points out the shortages of the problem research at the present time.2. According to survey and research container loading problem, the mathematicalmodel about the objective of maximizing container's utilization ratio was established in this paper. The principle of space division and merger was used, and three optimization strategies were proposed: they were the principle of width priority, the principle of similar cargo combination pretreatment and the principle of remaining space omitted, and ant colony optimization algorithm was integrated with it. Using the simulation to find better result of container loading problem, the result has showed that the model and the algorithm are effective.3. According to studying berth allocation problem with the window, the mathematical model for minimizing the total stay time of ships which achieve at port by the ideological of dynamics consecutive berths wan established in this paper. The principle of soft time window berth was proposed, punishing delay time. Combining with ant colony algorithm, applied matlab simulation to find the optimal allocation of berths, the simulation has showed that the model and the algorithm are effective.