Cutting Path Optimization Using Tabu Search

Article Preview

Abstract:

This paper deals with generating paths for cutting irregular parts nested on a metal sheet. The objective is to minimize the total non-cutting time for the cutter head starting at a known location, cutting all the required elements and returning to the known location. In contrast to most literature on this topic, a part does not have to be cut at once. If this reduces the total non-cutting time, it is possible to cut a number of elements on a given part, then cut other parts and then return later to finish cutting the given part. The problem is modeled as a generalized traveling salesperson problem with special precedence constraints. An initial feasible solution is generated and improved by local moves embedded in a tabu search framework. The proposed algorithm shows promising results in comparison with a commercial software package on a limited set of test cases.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

739-748

Citation:

Online since:

March 2011

Export:

Price:

[1] B. Verlinden et al.: Multiprocessor Scheduling: Theory and Applications, chapter 20. (2007).

Google Scholar

[2] J. Hoeft and U.S. Palekar: IIE Transactions. Vol. 29 (1997), pp.719-731.

DOI: 10.1023/a:1018582320737

Google Scholar

[3] D.V.S. Kumar: International Journal of Production Research. Vol. 36 (1998), p.1901-(1916).

Google Scholar

[4] M. Dror: IIE Transactions. Vol. 31 (1999), pp.271-274.

Google Scholar

[5] Y. Rao, G. Huang, P. Li, X. Shao, and D. Yu: The International Journal of Advanced Manufacturing Technology. Vol. 33 (2006), pp.436-448.

Google Scholar

[6] M. -K. Lee and K. -B. Kwon: International Journal of Production Research. Vol. 44 (2006), pp.5307-5326.

Google Scholar

[7] G. -chan Han and S. -joo Na: Journal of Manufacturing Processes. Vol. 1 (1999), pp.54-61.

Google Scholar

[8] G. -chan Han and S. -joo Na: Journal of Manufacturing Systems. Vol. 1 (1999), pp.62-70.

Google Scholar

[9] Y. Kim, K. Gotoh, and M. Toyosada: Journal of Marine Science and Technology. Vol. 9 (2004), pp.70-79.

Google Scholar

[10] K. Castelino, R. D'Souza, and P.K. Wright: Journal of Manufacturing Systems. Vol. 22 (2003), p.173–180.

Google Scholar

[11] L. Moreira, J. Oliveira, A. Gomes, and J. Ferreira: Computers & Operations Research. Vol. 34 (2007), pp.3281-3294.

Google Scholar

[12] S.S. Srivastava, S. Kumar, R.C. Carg, and P. Sen: CORS. Vol. 7 (1969), pp.97-101.

Google Scholar

[13] F. Glover and M. Laguna in: Tabu Search, Kluwer Academic Publishers, Boston (1999).

Google Scholar

[14] L. Muyldermans, P. Beullens, D. Cattrysse, and D. Van Oudheusden: Operations Research, Vol. 53 (2005), pp.982-995.

DOI: 10.1287/opre.1040.0205

Google Scholar

[15] L.M. Gambardella and M. Dorigo: INFORMS Journal on Computing (2000).

Google Scholar