Storage Allocation Plan Oriented Joint Optimization Of Truck Appointment And Dynamic Storage Allocation For Outbound Containers

Under the background of continuous large-scale container ships and increasing container throughput of container ports,Chinese ports are facing the dual pressure of insufficient available space and inefficient use of yard while their service capacity and service level are gradually improving.The operation efficiency of export container storage yard is increasingly becoming the bottleneck of improving the international competitiveness of ports.In the operation of container terminal,there is a high uncertainty in the distribution of export containers,which has a significant impact on the overall operation efficiency and the cost of the terminal.Therefore,how to improve the quality of the distribution of the export container space,the efficiency of the loading and unloading operation of the container terminal and the reduction the cost of the terminal operation,has become one of the important topics of the academic and industrial circles.This paper takes the integration of container shipping business process as the starting point,and carries out the joint optimization research of storage allocation plan oriented joint optimization of truck appointment and dynamic storage allocation through the operation route plan between the front ship and the port and the expansion of the reserved port function between the port and the vehicle,reducing the uncertainty of arrival order of export containers and improving the quality of distribution of export containers from the perspective of shipping business chain.The innovative work and research progress achieved in this paper can be summarized in the following three aspects.Firstly,the optimization model and algorithm of the storage allocation plan of the export containers is proposed.First of all,knowing the information of the booking order of the container terminal,the priority of storage is divided according to the attribute information of export containers.Secondly,under the constraints of operation route planning and zero rehandle demand,the optimization model is established to balance the allocation amount in each operation area for the export containers with different stacking priority and minimize the horizontal transportation distance of the internal trucks,an optimization model is established,a heuristic algorithm is designed to solve the problem and the best plan of export container allocation plan with interchangeability is obtained.Finally,compared with the existing literature,the results of empirical analysis show that the proposed model and algorithm can achieve the zero rehandle demand while taking into account the conflict of loading and taking containers and minimizing the travel distance of the yard quay,and occupying less storage space resources than the existing methods.Secondly,the optimization model and algorithm of the truck appointment plan of export containers based on storage allocation plan are proposed.First of all,according to the storage layout of the exchangeable export containers in the yard determined by the storage allocation plan,consider the available length of the port gathering time and the feasibility of parallel operation in the process of the port gathering,the export container groups are split and combined to form the basic unit of the port gathering.Secondly,taking the basic unit of the port collection as the object,the number of conflicts and gates of the port collection operation are comprehensively considered.The optimization model is constructed to minimize the rehandle of export containers and a heuristic algorithm based on rules is designed to solve the problem.Finally,the empirical analysis results show that the model and algorithm can effectively reduce the randomness of container arrival and increase the matching with the storage allocation plan.Thirdly,the optimization model and algorithm of the dynamic allocation of the export containers guided by the truck appointment plan are proposed.Firstly,according to the storage allocation plan,truck appointment plan and the stacking status of the yard,the optimization model of the dynamic allocation of the container is established with the goal of minimizing the demand of the container rahandle during the subsequent loading.Secondly,a heuristic algorithm based on mixed heap rules is designed to solve the problem.Finally,the empirical comparison analysis is carried out.Firstly,the simulation calculation is carried out for the single bay position of the mixed pile.The comparison results with the literature method show that the algorithm in this paper can effectively reduce the demand of rehandles of the export containers,thus verifying the effectiveness of the heuristic algorithm proposed in this paper.Then,the simulation results of large-scale calculation examples show that the number of stacking space occupied by this scheme is less than that of the comparison scheme,which can effectively improve the utilization of yard space,and prove the effectiveness of the optimization model of dynamic allocation of export containers proposed in this paper.This paper makes a further study on the optimization of the distribution of export containers in the container terminal.The research results are of great academic significance to further improve the quality of the distribution of export containers.At the same time,it has a significant practical value and a good application prospect to improve the overall operation efficiency and competitiveness of the container terminal.