NSGA-II-based improved transtainer scheduling method

Abstract

The invention discloses a NSGA-II-based improved transtainer scheduling method. According to the method, a crowding degree calculation method and control on an elitist range are improved on the basisof the NSGA-II (Elitist Non-dominated Sorting Genetic Algorithm); so that a crowding degree calculation method containing more information of individuals and an elitist range-improved NSGA-II algorithm can be introduced; the improved NSGA-II algorithm is applied to container yard / transtainer scheduling, and therefore, the operation completion time of the container filling of a yard and the transition time of a transtainer can be decreased; the improved NSGA-II algorithm, the NSGA-II and an NSGA-II+IMP algorithm are tested on four test functions, and test results show that the Pareto solution set of the improved NSGA-II of the invention has better distributivity and convergence and can better maintain population diversity.

Description

technical field [0001] The invention relates to an improved yard bridge scheduling method based on NSGA-II. Background technique [0002] After the ship arrives at the port, berths are assigned to it according to the berth resources and ship information. When unloading the ship, the quay crane will unload the container from the ship to the container truck, and the container truck will transport the container to the container area designated by the yard, and then the container crane will unload the container Put it in the designated box. The loading process is reversed. The container yard includes many container areas for the temporary storage of export and import containers. The loading and unloading of containers in the yard is completed by yard bridges, and the transportation is completed by trucks. The workload of each container area should be completed within the planned period as much as possible. [0003] In order to make full use of the yard bridge resources to com...

AI Technical Summary

Problems solved by technology

[0005] In recent years, a multi-objective genetic algorithm based on the idea of ​​Pareto optimality has been produced, among which the non-dominated sorting genetic algorithm (Elitist Non-dominated Sorting Genetic Algorithm, NSGA-II) proposed by Deb has been widely used for its good performance. Concerned about and applied, Liu Xin aimed at the shortest transition time of yard and bridge and the shortest completion time of yard and bridge operations, and used NSGA-II to solve the optimization problem of yard and bridge in container yards, but directly using NSGA-II could not get satisfactory results

Images