Berth Allocation Of Container Terminal Based On Service Priority

Berth resource is an important resource of the terminal,and its operation efficiency has a direct influence on the overall operation efficiency of the terminal.A reasonable and effective berth allocation plan can improve the efficiency of berth operation so as to improve the overall operation efficiency of the terminal.In this paper,the dynamic continuous berth allocation problem is mainly researched and the plan for arriving ships is made.Meanwhile,from the point of view of the port,this paper takes the priority of berthing into account when making the berth allocation plan.In order to solve the berth allocation,the genetic-harmony search algorithm is designed.Finally,the experiments show that the genetic-harmony research algorithm can sole the berth allocation problem,and has good performance.The main contents of this paper are as follow:According to the characteristics of the dynamic continuous berth scheduling problem,the paper establishes a mixed nonlinear programming fmodel with the minimum total stay time as the objective function in order to reduce the stat time of ships and increase the operation efficiency of the port.Firstly,the constraint function of ships both in time and in space is set up to make the model conform to the characteristics of dynamic arrival.Secondly,the constraint function of the ships' berthing position is set up to make the model conform to the continuous berth.From the point of view of the port,this paper considers the service priority when making the berth scheduling plan because of the idea that the large ship has higher priority of berthing.In the past,loading and unloading capacity has been selected as the index to measure the berthing priority,which only considers the interests of ports.In this paper,not only the interests of ports but also the satisfaction of arriving ships is considered.Therefore,the arrival time and the ideal departure time is also used as evaluation indexes to estimate ships.Firstly,entropy method is used to calculate the index weights of capacity,the arrival time and the ideal departure time.Secondly,the berthing priority is calculated by TOPSIS(Technique for Order Performance by Similarity to Ideal Solution).Because the berth scheduling problem is NP-complete,the genetic-harmony search algorithm is designed to solve the berth allocation problem in this paper.In order to obtain the better results,the genetic algorithm is used to optimize the harmony search algorithm.Firstly,First,it is proved that the performance of genetic-harmony search algorithm is better than that of harmony search algorithm by solving the general test function.Then it is proved that the genetic-harmony search algorithm can get better results than the harmony search algorithm in solving the berth allocation problem through the simulation of the specific data.In order to evaluate the performance of the genetic-harmony search algorithm in solving the berth scheduling problem,this paper uses the algorithm and LINGO to find the optimal solution at the same time.The result shows that the genetic-harmony search algorithm is fast and effective.