Optimization of Steel Plate Cutting Sequence Using the Tabu Search Method

2005 ◽  
Vol 21 (02) ◽  
pp. 134-139
Author(s):  
Yasuhisa Okumoto ◽  
Ryutaro Iseki

This study concerns the cutting scheduling of steel plates by numerically controlled (NC) machines in shipyards. The combinatorial optimization of the cutting sequence to minimize the idle time of machines has been examined for processing many plates by multiple cutting machines. As an algorithm of the optimization, the tabu search method, which is a kind of metaheuristic technique and has been widely applied recently for such optimization problems, was adopted. The procedure was programmed on a personal computer, and calculations were carried out for test data as well as field data. It was confirmed that the idle time to wait for the next process decreased remarkably compared with the initial planned sequence, and the tabu search method was a simple and effective method to solve combinatorial problems.

Author(s):  
Chi Xie ◽  
Mark A. Turnquist ◽  
S. Travis Waller

Hybridization offers a promising approach in designing and developing improved metaheuristic methods for a variety of complex combinatorial optimization problems. This chapter presents a hybrid Lagrangian relaxation and tabu search method for a class of discrete network design problems with complex interdependent-choice constraints. This method takes advantage of Lagrangian relaxation for problem decomposition and complexity reduction while its algorithmic logic is designed based on the principles of tabu search. The algorithmic advance and solution performance of the method are illustrated by implementing it for solving a network design problem with lane reversal and crossing elimination strategies, arising from urban evacuation planning.


2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi

Author(s):  
Hamza Gharsellaoui ◽  
Hamadi Hasni

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, they undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper’s benchmarks in order to support and to prove their approach and to evaluate the performance.


Sign in / Sign up

Export Citation Format

Share Document