Combined Dispatch Of Yard Crane And Container Truck Under Dynamic Conditions

Shipping is an important way of transportation in international trade,and container terminal is a crucial node for shipping.As the growth of container throughput within the scope of the world,operational efficiency and ability of container terminal need to be promoted.Scheduling optimization is the important way to improve operational efficiency and ability of container terminal.Operation scheduling of container terminal contains multiple types.This paper mainly studies the dispatch of multiple yard cranes under influence of container truck arrival in different blocks.An integer programming model is proposed in the dissertation to minimize the makespan and delay of all the handling jobs performed by multiple yard cranes and trucks subject to the constraints of maintaining a minimum safety distance between two adjacent cranes and avoiding crane-interference.It is noted that the scheduling problem is NP-hard and the computational effort for finding the optimal solution of large scale problems is intractable.Multi-objective programming is harder,so previous researches unified the objectives to one objective.This dissertation proposes a Genetic Algorithm to solve the scheduling problem.An improved version of Genetic Algorithm,NSGA-II algorithm,is developed to solve the problem.Computational experiments are carried out to evaluate the performance of the algorithm and the lower bound found by CPLEX used as a benchmark.It is found that the algorithm is better than CPLEX in computing large large-scale numerical examples.Finally,This dissertation provides a reasonably good solution for combined dispatch of yard crane and container truck under dynamic conditions.