A model and solution method for ship pilotage scheduling problem

Abstract

The invention discloses a vessel pilot scheduling problem model and a solving method. On the basis of analyzing various written scheduling rules and unwritten scheduling habits of pilot scheduling, and aiming at the problem that the conventional solving method is non-feasible, the method for converting the model into a pseudo traveling salesman problem is provided. The method sequentially comprises the following steps of (1) establishing a local database, and selecting from a pool according to the contract; (2) selecting the vessels to be piloted from the pool, and establishing a pilot scheduling problem model; (3) solving the pilot scheduling problem model based on a distribution estimation improvement discrete particle swarm algorithm, and finding an optimal pilot scheduling plan; (4) performing pilot scheduling according to the determined optimal pilot scheduling plan. According to the method, the algorithm efficiency is improved; through leading into optimal particle subgroups, the method has the characteristics of being rapid in searching speed and high in searching precision. The vessel pilot scheduling problem model is effective, and the solving method is efficient.

Description

technical field [0001] The invention belongs to a method for scheduling pilotage tasks in pilotage dispatching, and in particular relates to a problem model and a solution method for ship pilotage scheduling. Background technique [0002] my country is a big port country. However, with the rapid development of ports, my country's ports are relatively backward in the efficiency of pilotage dispatching, which seriously restricts the core competitiveness of ports and causes a certain waste of resources. Pilotage companies urgently need to establish an efficient and feasible pilotage scheduling system to optimize the allocation of pilotage resources and improve port competitiveness. The management focus of pilotage scheduling is on pilotage scheduling. Therefore, to explore the modeling optimization and effective solutions of pilotage scheduling in pilotage scheduling has become a key theoretical problem to be solved urgently. [0003] Pilot scheduling problem is an NP-hard co...

AI Technical Summary

Problems solved by technology

[0005] 1. The two-step approach is easy to produce infeasible solutions during the algorithm search process. Necessary strategies for eliminating infeasible solutions need to be added to the intelligent optimization algorithm to increase the difficulty of algorithm design;

[0006] 2. Existing methods only consider finding feasible scheduling results within the scope of pilotage rules, but do not comprehensively consider the waiting time between pilotage tasks, the time balance of pilotage task groups, and the cost issues caused by the transfer of the beginning and end locations of pilotage task groups

[0007] 3. The search ability of the basic intelligent optimization algorithm is limited, especially when the number of pilotage tasks is large and the number of considerations increases, the search for the optimal solution will appear powerless

Images