Iterated greedy algorithm applied to the navigation lock arrangement problem

The inland waterway transport is recognized as large volume, low energy consumption and low pollution when compared to other modes. With the development of economy and the improvement of waterway conditions, the volume of inland waterway transport continues to grow at a high speed, the problem of lock congestion and long waiting time is serious more and more, this has brought certain environmental problems, economic problems and social problems. Therefore, studying how to improve the navigation lock passing capacity is of great significance for reducing environmental pollution, decreasing the possibility of social problems and improving economic benefits. This paper discusses the influencing factors of the navigation lock passing capacity, proposes the calculation formula of the actual annual deadweight tonnage of lockage ships and the concept of the navigation lock arrangement problem and its constraints, describes the solution of the navigation lock arrangement problem in a plane Cartesian coordinate system, establishes the iterated greedy algorithm for the navigation lock arrangement problem, and implements corresponding algorithm through further design. The experimental results show that the iterated greedy algorithm is effective to the navigation lock arrangement problem, and better than the results of the related research in the utilization rate of the navigation lock chamber.