Berth-Crane Allocation Model and Algorithm of Container Berths in the Uncertain Environment

摘要

According to the randomness of the vessel's arrival time and handling time, the establishment of a randomly-oriented environment container berths— crane allocation model, the optimizing goal is to minimize the average shipwaiting time. Taking into account the complexity of the model solution, this paper offers the design of an improved genetic algorithm to reduce the searching space, and according to the characteristics of the optimal solution. With testing example to verify that the model can simulate decision-making environment of berths— crane allocation problem and reflect the decision-maker's attitude toward risks and preferences. The algorithm can gain a stable and satisfactory solution within the operating time.