Research on ship in and out scheduling under linear constraint of meeting delay

Ship in and out scheduling is an important issue and complex problem for harbor traffic organization. In this paper, based on the safety distance model for meeting, the objective function of ship arrival and departure scheduling is constructed, and the linear constraint condition and its analytical formula of the encounter delay are obtained. Inspired by the traveling salesman problem, the GA-PS algorithm is proposed to solve the ship arrival and departure scheduling plan. The feasibility and effectiveness of GA-PS algorithm are verified by the actual port data. The in and out plan of port traffic has been calculated. The verification result illustrates that the GA-PS algorithm can solve the ship scheduling problem with linear constraint.