Mathematical Model and IDPSO Algorithm Research on Dynamic FleetPlanning

A mathematical model for dynamic fleet planning with multi routes and multi ship, which took the maximum total operation profits as its objective function, was built up according to the characteristics of the shipping company. The model had the following characteristics: Firstly in the model, the long-term fleet planning and short-term scheduling were combined. Secondly, the economic and technology indexes were changed with ship's age, which fully reflect the dynamic fleet planning. At the same time, because of being at a large scale, discrete, multi-dimensional and multi-stage optimiza- tion problem has become very difficult to solve. An improved discrete particle swarm optimal (IDPSO) algorithm was used to solute the model. According to the characteristics of the traditional discrete particle swarm optimization algorithm, some methods including coding strategy, iterative formula, initialization, dimension mutation operator to avoid precocious etc. for discrete particle swarm algorithm, were used to improve the method, which can be more suitable for fleet plan- ning's mathematical model and to avoid premature phenomenon. Finally, an example was given to show that the im- proved method was effective.

[1]  Krishan Rana,et al.  Routing Container Ships Using Lagrangean Relaxation and Decomposition , 1991, Transp. Sci..

[2]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[3]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[4]  Arnoldo C. Hax,et al.  Optimization of a Fleet of Large Tankers and Bulkers: A Linear Programming Approach , 1972 .

[5]  T. A. J. Nicholson,et al.  Dynamic Programming Applied to Ship Fleet Management , 1971 .

[6]  Ning Li,et al.  Particle swarm optimization with mutation operator , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[7]  Junying Chen,et al.  Particle Swarm Optimization with Local Search , 2005, 2005 International Conference on Neural Networks and Brain.

[8]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[9]  Yu Liu,et al.  Using relaxation velocity update strategy to improve particle swarm optimization , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[10]  Anastassios N. Perakis,et al.  Fleet deployment optimization for liner shipping Part 1. Background, problem formulation and solution approaches , 1991 .

[11]  B. J. Powell,et al.  Fleet deployment optimization for liner shipping: an integer programming model , 1997 .