Font Size: a A A

Container Berths Dispatch Optimization Model And Algorithm Research

Posted on:2012-02-12Degree:MasterType:Thesis
Country:ChinaCandidate:H B ZhangFull Text:PDF
GTID:2212330371451844Subject:System theory
Abstract/Summary:PDF Full Text Request
With the coming of economical globalization and the rapidly developing of international shipping business, the competition among seaports becomes more and more fiercely in the world. How to improve the working efficiency and the service quality, what has became the critical factors in the enterprise development. Berth is the key resources in the port. So how to improve the utilize efficiency of berth is important to reduce production costs in the port enterprise. Port enterprise is confronted with how to improve the utilization efficiency of berth, so the research of berth scheduling algorithm has realistic significance.In this paper, the utilization of berths is considered as a main subject. The berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints. A nonlinear programming model for the problem is established, and a heuristic algorithm is proposed to solve the model according to the constrains. The two different category berth, discrete and continuous, is transformed into two different packing problems. The algorithm solves the two problem, and the simulation results is compared with other and show that this algorithm based on heuristic rules in container berths scheduling can effectively improve the utilization efficiency of the container berths after several tests.The main contents of this paper are composed of three parts as following:Firstly, the concepts, research status and research methods of the container berth scheduling problem and the two-dimensional packing problem are analyzed in-depth. With special rectangular coordinates, the berth scheduling problem is transformed into a packing model.Secondly, for the discrete and continuous berth scheduling model established in the second part, a heuristic algorithm is put forward based on the actual container shipping berthing operation process, both the time and space constraints to solve the problems. The algorithm proposed can solve the berth scheduling problem, a real scheduling problem in some port is used as an example to test the efficiency of the algorithm. Simulation results show that our algorithm can improve the working efficiency.Finally, the innovation and realistic meaning are analyzed and expounded, and the future research direction is given in the end. Meanwhile, the limitation and shortcomings of the paper and future improvements are listed.
Keywords/Search Tags:berth scheduling, two-dimensional packing, heuristic algorithm
PDF Full Text Request
Related items