在装船的过程中受到不同因素的制约,因此装船顺序问题是组合优化问题。本文研究船舶的稳定性和翻箱率问题,将航程作为约束条件,建立装船顺序整数规划模型,最后利用粒子群算法进行模型求解,通过实验结果可以看出,此方法收敛速度快,能够求取得到全局最优解。
The loading sequence is a combinatorial optimization problem, which is restricted by different factors during the loading process. In this paper, study the stability of the ship and turn over the box. As a constraint condition, an integer programming model of loading sequence was established. Finally, the particle swarm optimization algorithm was used to solve the model. The experimental results showed that this method had fast convergence rate and could obtain the global optimal solution.
2017,39(1A): 147-149 收稿日期:2016-10-14
DOI:10.3404/j.issn.1672-7619.2017.1A.050
分类号:U665.26A
作者简介:周晓峰(1979-),男,硕士,讲师,研究方向为偏微分方程、数学模型及高等数学教学研究。
参考文献:
[1] CHEN C S, LEE S M, SHEN Q S. An analytical model for the container loading problem[J]. European Journal of Operational Research, 1995, 80(1):68-76.
[2] AMBROSINO D, SCIOMACHEN A, TANFANI E. Stowing a containership:the master bay plan problem[J]. Transportation Research Part A Policy & Practice, 2004, 38(2):81-99.
[3] BORTFELDT A, GEHRING H, MACK D. A parallel tabu search algorithm for solving the container loading problem[J]. Parallel Computing, 2003, 29(5):641-662.
[4] 潘峰, 陈杰, 甘明刚, 等. 粒子群优化算法模型分析[J]. 自动化学报, 2006, 32(3):368-377.