Study on the layout optimization of platform based on simulated annealing algorithm

被引：0

作者：

Zheng, Dequan ^{[1
]}

机构：

[1] School of Management, Harbin Institute of Technology, Harbin

来源：

Zheng, D. (zhengdequan@hit.edu.cn) | 1793年 / Academy Publisher卷 / 08期

关键词：

Block assembly planning; Rotating search; Simulated annealing algorithm; Two-dimensional packing;

D O I：

10.4304/jsw.8.7.1793-1800

中图分类号：

学科分类号：

摘要：

Aiming at the production scheduling problem in the hull block production, this study investigates the maximum use of the assembly blocks working platform. By transforming the scheduling problem into two-dimensional bin packing problem, this study explores the effective block spatial layout under the condition of spatial constraints. In order to improve the drawbacks of the lowest horizontal line algorithm, this study proposes the lowest horizontal line-rotate searching algorithm. By combing the simulated annealing algorithm and the lowest horizontal line-rotate searching algorithm, the simulated results show that such scheduling approach can produce much better planning results. Finally, the study carries out a number of simulation experiments to optimize the parameters in practical application. © 2013 ACADEMY PUBLISHER.

引用

页码：1793 / 1800

页数：7

共 17 条

[1]

Kumar A.A., Kazuhiro A., Evaluation and management of the cost and risk of welded formations in modular ship construction, Journal of Ship Production, 21, 1, pp. 8-13, (2005)

[2]

Hifi M., Zissimopolous V., Constrained two-dimensional cutting:An improvement of Christ fides and Whitlock's exact algorithm, J.Oper.Res.Soc, 48, pp. 324-331, (1997)

[3]

Burke E.K., Kendall G., Whitwell G., A New Placement Heuristic for the Orthogonal Stock-Cutting Problem, Operations Research, 52, 4, pp. 655-671, (2004)

[4]

Zhang D., Kang Y., Deng A., A new heuristic recursive algorithm for the strip rectangular packing problem, Computer& Operations Research, 33, 8, pp. 2209-2217, (2006)

[5]

Wu Y.-L., Huang W., Lau S.-C., Wong C.K., An effective quasi-human based heuristic for solving the rectangle packing problem, European Journal of Operational Research, 141, pp. 341-358, (2002)

[6]

Huang W., Chen D., Ruchu X., A new heuristic algorithm for rectangle packing, Computers&Operations Research

[7]

Dagli C.H., A simulated annealing approach for solving stock cutting problem, Proceedings of IEEE International Conference On Systems, pp. 221-223, (1990)

[8]

Lai K.K., Chan J.W.M., Developing a simulated annealing algorithm for the cutting stock problem, Comput.Indust.Engrg, 32, 1, pp. 115-127, (1996)

[9]

Faina L., An application of simulated annealing to the cutting stock problem Eur, J.Oper Res, 114, pp. 542-556, (1999)

[10]

Burke E.K., Kendall G., Whitwell G., Metaheuristic Enhancements of the Best-fit Heuristic For the Orthogonal Stock Cutting Problem[R], (2006)

← 1 2 →