A problem of a line-cutting procedure is discussed for ship hull construction. This procedure includes five steps: stock arrangement, piece arrangement, marking, cutting and special processes, and delivering the work. The line-cutting procedure will be optimized when two objectives are considered: minimizing the total trim loss and keeping the working efficiency of the cutting procedure. The developed way for the discussed problem is to optimize the stock arrangement associated with a proposed rule-based piece arrangement where the former is optimized for minimizing the total trim loss and the latter for keeping the working efficiency. A tabu search is chosen for the optimization of stock arrangement. In addition, two proposed replacement moves, the aggregative and the breaking, are adopted to improve the effectiveness of the tabu search. Two real cases and some random instances are used for test and comparison. The results show that the stock arrangement was optimized satisfyingly by the tabu search and the rule-based piece arrangement is capable of keeping the working efficiency as usual. In addition, the effectiveness of the tabu search was apparently improved by two proposed replacement moves.
[1]
P. Pardalos,et al.
Handbook of Combinatorial Optimization
,
1998
.
[2]
Armin Scholl,et al.
Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
,
1997,
Comput. Oper. Res..
[3]
Fred W. Glover,et al.
Tabu Search - Part I
,
1989,
INFORMS J. Comput..
[4]
L. Kos,et al.
Cutting optimization with variable-sized stock and inventory status data
,
2002
.
[5]
Fred Glover,et al.
Tabu Search - Part II
,
1989,
INFORMS J. Comput..
[6]
Tso-Chung Sung,et al.
A Two-Stage Optimization of Piece Arrangement for the Cutting Problem in Shipbuilding
,
2004
.
[7]
Peter Trkman,et al.
A combined approach to the solution to the general one-dimensional cutting stock problem
,
2005,
Comput. Oper. Res..