Heuristics for the plate-cutting traveling salesman problem

IIE Transactions (Institute of Industrial Engineers)

Volumn 29, Issue 9, 1997, Pages 719-731

  Hoeft, Jeffrey ^a   Palekar, Udatia S ^b  

^a Caradco Inc   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUTTING; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PLATES (STRUCTURAL COMPONENTS); PROBLEM SOLVING;

PLATE CUTTING TRAVELING SALESMAN PROBLEM (PTSP);

COMPUTATIONAL GEOMETRY;

EID: 0031224367     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179708966382     Document Type: Article

References (17)

1. Dror, M., Stern, H., and Trudeau, P., (1987) Postman tours on a graph with precedence relation on arcs. Networks, 17 (3), 283–294.
2. Manber, U., and Israni, S., (1984) Pierce point minimization and optimal path determination in flame cutting. Journal of Manufacturing Systems, 3 (1), 81–89.
3. Francis, R., McGinnis, L., and White, J., (1992) Facility Layout and Location An Analytical Approach, 2nd edn, Prentice-Hall, Englewood Cliffs, NJ.
4. Lawler, E., Lenstra, J., Rinnooy Kan, A., and Shmoys, D., (1985) The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization. John Wiley and Sons, New York.
5. Laporte, G., Mercure, H., and Nobert, Y., (1985) Finding the shortest Hamiltonian circuit through clusters a lagrangean relaxation approach. Congressus Numerantium, 48, 277–290.
6. Noon, C., and Bean, J., (1991) A Lagrangean based approach for the asymmetric generalized traveling salesman problem. Operations Research, 39 (4), 623–632.
7. Noon, C., and Bean, J., (1989) An efficient transformation of the generalized traveling salesman problem. Working Paper, University of Tennessee, Knoxville, TN.
8. Blazewicz, J., Hawryluk, P., and Walkowiak, R., (1993) Using a tabu search approach for solving the two-dimensional irregular cutting problem. Annals of Operations Research, 41, 313–325.
9. Garey, M.R., Graham, R.L., and Johnson, D.S., (1976) Some NP-complete geometric problems, in Proc. 8th Ann. ACM Symposium on Theory of Computing, ACM, New York, pp. 10–22.
10. Lin, S., and Kernighan, B., (1973) An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21 (2), 498–516.
11. Guignard, M., and Kim, S., (1987) Lagrangean decomposition a model yielding stronger Lagrangean bounds. Mathematical Programming, 39 (2), 215–228.
12. Geoffrion, A.M., (1974) Lagrangean relaxation and its uses in integer programming, in Mathematical Programming Study, vol. 2, North Holland, Amsterdam, pp. 82–114.
13. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., (1989) Network flows, in Optimization, Nemhauser, G.L. et al. (ed.), Handbooks in Operations Research and Management Science, vol. 1, North-Holland, Amsterdam.
14. Goldfarb, D., and Todd, M.J., (1989) Linear programming, in Optimization, Nemhauser, G.L. et al. (ed.) jt, Handbooks in Operations Research and Management Science vol. 1, North-Holland, Amsterdam.
15. Stewart, W., (1977) A computationally efficient heuristic for the traveling salesman problem, in Proceedings of the 13th Annual Meeting of S. E. TIMS, The Institute of Management Science, Providence, RI. pp. 75–78.
16. Bozer, Y., Schorn, E., and Sharp, G., (1990) Geometric approaches to the Chebyshev traveling salesman problem. IIE Transactions, 22 (3), 238–254.
17. Fischeti, M., and Toth, P., (1989) An additive bounding procedure for combinatorial optimization problems. Operations Research, 37 (2), 319–328.