Multi-objective optimization model and ant colony optimization of liner ship scheduling

Aiming at liner ship scheduling problem, on the basis of rational allocation for liner ships to different round trips and non-existing time conflict, the minimum variation cost on liner ship, the minimum carrying amount notch on route and the absolute minimum deviation of total liner voyages were taken as objective functions, a time-space network was constructed based on port periods and round liners, and a 0-1 integer programming mathematical model was established. The historical data of a certain liner shipping company were analyzed, ant colony optimization was used to solve the model, and a neighborhood search technique was integrated to raise the efficiency. Calculation result shows that while the carrying amount can meet the running requirement, the daily liner variation cost of liner running decreases from 198 086.3 yuan to 170 472.2 yuan, and decreases by about 13.9%. The absolute deviation of total liner voyages decreases from 4.4 times to 2.2 times, and decreases by about 45. 5%, and liner utilization ratio is more equilibrium. Obviously, the proposed model is feasible, and the algorithm is effective.