Study On Simulated Annealing Algorithm-based Pilotage Scheduling System

Although the global economy is still in the shadow of being, China's port construction revealed a contrarian rise. According to the latest top ten ports in the world rankings in 2010, China accounted for six seats. While the rapid development of the port, the port pilotage of informatization construction is relatively backward, and this severely restricts the core competitiveness of the port, also caused some waste of resources. The Pilot Station urgently need for a high degree of automation of the pilotage scheduling system to optimize the pilotage resources allocation. Pilotage scheduling problem belongs to combinatorial optimization problems of scheduling, in manual actual scheduling have the limit of complicated rules and unexpected factors, which reduces the efficiency of scheduling. This paper is focused pilot scheduling system's scheduling issues, proposed based on intelligent algorithms - simulated annealing algorithm to optimize the scheduling results, and make a graphical interface, has good effect in practice.Currently used in combinatorial optimization algorithms are mainly local search algorithm, simulated annealing algorithm, genetic algorithm, neural networks,etc. Simulated annealing algorithm is rooted in solid annealing process of a kind of random search algorithm, which can search out the global optimal solution in non-linear space in faster time.Based on the actual scheduling requirements of the pilot station in Guangzhou,this paper introduce the entire scheduling process, summarizes the pilot scheduling rules, analyze the commonly used scheduling algorithms. Second, the simulated annealing algorithm is applied to pilot automatic scheduling, improved scheduling accuracy and efficiency. Finally, functional modular design of the scheduling system, giving users a graphical interface for high availability operating environment.