Research On Cargo Stowage For Steel Maritime Logistics

In recent years,the bulk commodity logistics industry represented by steel logistics has achieved rapid development,but also exposed many problems within the industry.Maritime transportation is the most important mode of transportation in steel logistics,with large single transportation volume,long transportation distance,relatively low transportation costs.At the same time,it also faces many challenges: how to fully utilize currently available ships and shorten the transportation cycle of goods; How to reduce the number of unloading ports and the number of stacking times during unloading,and improve the interests of the ship owner; How to fully consider the storage location of goods,reduce the number of stacking operations,and improve the efficiency of warehouse operations; How to balance the operation situation of each warehouse,reduce driver waiting time,and improve the efficiency of loading operations.Faced with such complex cargo loading rules,how to achieve more satisfactory results through loading is the problem that this article will study.This article takes the steel shipping in a port as the background,and studies the cargo stowage in maritime logistics.Through field research on the loading of steel maritime cargo in ports,the loading of steel maritime cargo in the entire port is divided into three parts: ship cargo matching,loading plan loading,and vehicle cargo matching.Ship cargo matching refers to matching the goods in the warehouse that need to be transported by sea with the currently available ships.Loading plan refers to the allocation of all loaded goods to each cabin.Truck cargo matching refers to allocating the goods in the warehouse that need to be loaded onto trucks,and then using trucks to transport the goods to the wharf for loading.The main work of this paper includes the following aspects:(1)Ship and cargo matching based on linear programming and clustering:This paper proposes a ship and cargo matching algorithm based on linear programming and clustering.The algorithm is divided into two parts.The ship and cargo matching problem of a single location is defined as a linear programming problem,which is solved by using the linear programming method; For the case of multiple locations,the DBSCAN algorithm is used to cluster the multiple locations according to the distance,and then the cargo of each location in each category is loaded with ships using the linear programming method.Finally,based on the matching results of the ship and cargo,consider factors such as the delivery time agreed by the customer and the production time of the goods to load the ship with a specific shipping list.(2)Research on ship loading diagram based on improved NSGA-Ⅱ algorithm: In this paper,a loading method based on the improved NSGA-Ⅱ algorithm(INSGA-Ⅱ algorithm)is proposed.The algorithm designs two optimization objectives: to minimize the number of cabins allocated for cargo of each barge and the number of cabins allocated for cargo of each ticket.On the basis of NSGA-Ⅱ algorithm,the initial heuristic algorithm is added,the traditional one-to-one genetic strategy is changed,and the dynamic crossover probability and mutation probability are designed to build a multi-objective optimization algorithm for solving the ship loading diagram.Finally,the feasibility and superiority of this algorithm are verified by using real data and comparing with NSGA-Ⅱ algorithm.(3)Vehicle and cargo matching based on minimizing the number of stacking and vehicle waiting time:This article proposes a vehicle cargo matching algorithm based on minimizing the number of stacking operations and vehicle waiting time,achieving a second level response.The algorithm is based on the idea of heuristic algorithm and is divided into two stages.In the stage of minimizing the number of stacks,the main consideration is the specific location of goods in the warehouse,in order to reduce the number of stacks of goods and improve the efficiency of warehouse operations.In the phase of minimizing vehicle waiting time,according to the warehouse operation efficiency and the quantity of goods that each warehouse needs to operate at present,on the basis of ensuring the loading sequence,the subsequent vehicles are loaded with goods from the warehouse with less waiting time.This paper studies the entire process of steel shipping cargo stowage in a port,and proposes three corresponding cargo stowage schemes for three business nodes.The feasibility and performance of the algorithm have been verified through a large number of experiments,and compared with other methods.In the problem of ship cargo matching,the total cargo stowage rate reaches 97.08%.The improved NSGA-Ⅱ algorithm in the ship loading diagram problem has significantly better results than the original algorithm.The method proposed in this article in the vehicle cargo matching problem can reduce the stacking times by 70.73% and improve the operation efficiency by 33.68%.The results show that the stowage scheme proposed in this paper can improve the satisfaction of shipowners,drivers,and customers,reduce the number of warehouse destacking,improve resource utilization,and ultimately improve the efficiency of the entire maritime operation.The research results of this article have been applied and verified in the actual business of the port.