Automatic production planning of press brakes for sheet metal bending

References

• Beullens , P , Cattrysse , D and Van Oudheusden , D . 2003a . “ A new local search approach for the symmetric generalized traveling salesman problem ” . In Working Paper 2003/22 , K.U. Leuven, , Belgium : Centre for Industrial Management .
   Google Scholar
• Beullens , P , Muyldermans , L , Cattrysse , D and Van Oudheusden , D . 2003b . A guided local search heuristic for the capacitated arc routing problem . Eur. J. Oper. Res. , 147 : 629 – 643 .
   Google Scholar
• Crauwels , HAJ , Collin , Ph , Duflou , J and Van Oudheusden , D . 2003 . Tooling layout on a press brake for sheet metal air bending . Prod. Plan. Control. , 16 : 514 – 525 .
   Google Scholar
• De Vin , LJ . 1998 . “ Tool selection and bend sequencing for die-bending ” . In Proceedings of the SHE-MET Conference , 189 – 198 . The Netherlands : Enschede .
   Google Scholar
• Duflou , JR , Nguyen , THM , Kruth , JP and Cattrysse , D . An optimisation system for automated workpiece layout generation for bent sheet metal parts . Proceedings of the SHE-MET Conference . pp. 235 – 244 . UK : Jordanstown .
   Google Scholar
• Duflou , JR , Van Oudheusden , D , Kruth , J-P and Cattrysse , D . 1999 . Methods for the sequencing of sheet metal bending operations . Int. J. Prod. Res. , 37 : 3185 – 3202 .
   Web of Science ®Google Scholar
• El-Darzi , E and Mitra , G . 1995 . Graph theoretic relaxations of set covering and set partitioning problems . Eur. J. Oper. Res. , 87 : 109 – 121 .
   Google Scholar
• Erlenkotter , D . 1978 . A dual-based procedure for the uncapacitated plant location problem . Oper. Res. , 26 : 992 – 1002 .
   Web of Science ®Google Scholar
• Franke , V . Automation of tool planning for bent components . Proceedings of the 3rd International Conference on Sheet Metal . pp. 35 – 44 . UK : Birmingham .
   Google Scholar
• Gheysens , J and Vansteenwegen , P . 2002 . “ Bewegingsanalyse en tijdsraming voor buigprocessen ” . Leuven, , Belgium : Mechanical Engineering, K.U. Leuven . Unpublished thesis
   Google Scholar
• Golden , BL , Levy , L and Dahl , R . 1981 . Two generalizations of the traveling salesman problem . Omega , 9 : 439 – 445 .
   Web of Science ®Google Scholar
• Hoffmann , M , Geißler , U and Geiger , M . 1992 . Computer-aided generation of bending sequences for die-bending machines . J. Mater. Process. Technol. , 30 : 1 – 12 .
   Web of Science ®Google Scholar
• Johnson , DS and McGeoch , LA . 1997 . “ The traveling salesman problem: a case study ” . In Local Search in Combinatorial Optimization , Edited by: Aarts , E and Lenstra , JK . 215 – 310 . Chichester, , UK : Wiley .
   Google Scholar
• Lawler , EL , Lenstra , JK , Rinnooy Kan , AHG and Shymoys , DB . 1985 . The Traveling Salesman Problem, a Guided Tour of Combinatorial Optimization , Chichester, , UK : Wiley .
   Google Scholar
• Noon , CE . 1988 . “ The generalized traveling salesman problem ” . In PhD thesis , Ann Arbor, MI : University of Michigan .
   Google Scholar
• Ong , HL . 1982 . Approximate algorithms for the traveling purchaser problem . Oper. Res. Lett. , 1 : 201 – 205 .
   Google Scholar
• Pearn , WL . 1991 . “ On the traveling purchaser problem ” . In Working Paper 91–01 , National Chiao Tung University .
   Google Scholar
• Ramesh , R . 1981 . Travelling purchaser problem . Opsearch , 18 : 78 – 91 .
   Google Scholar
• Renaud , J and Boctor , FF . 1998 . An efficient composite heuristic for the symmetric generalized traveling salesman problem . Eur. J. Oper. Res. , 108 : 571 – 584 .
   Web of Science ®Google Scholar
• Rico , JC , Gonzalez , JM , Mateos , S , Cuesta , E and Valino , G . 2003 . Automatic determination of bending sequences for sheet metal parts with parallel bends . Int. J. Prod. Res. , 41 : 3273 – 3299 .
   Web of Science ®Google Scholar
• Shpitalni , M and Saddan , D . 1994 . Automatic determination of bending sequence in sheet metal products . Ann. CIRP , 43 : 23 – 26 .
   Google Scholar
• Singh , KN and Van Oudheusden , DL . 1997 . A branch and bound algorithm for the traveling purchaser problem . Eur. J. Oper. Res. , 97 : 571 – 579 .
   Google Scholar
• Snyder , LV and Daskin , MS . 2000 . “ A random-key genetic algorithm for the generalized traveling salesman problem. Working paper ” . USA : Northwestern University .
   Google Scholar
• Srivastava , SS , Kumar , SS , Carg , RC and Sen , P . 1969 . Generalized travelling salesman problem through n sets of nodes . J. Can. Oper. Res. Soc. , 7 : 97 – 101 .
   Google Scholar
• Voudouris , C and Tsang , E . 1999 . Guided local search and its applications to the traveling salesman problem . Eur. J. Oper. Res. , 113 : 469 – 499 .
   Web of Science ®Google Scholar