| P. Jain, P. Fenyes, R. Richter, Optimal blank nesting using simulated annealing, J. Mech. Design 114 (1) (1992) 160--165. |
....and meta heuristics are limited in theory because they cannot say no if there is no solution. According to our sources in the apparel industry, available layout software is limited in practice to falling about 5 behind humans in cloth utilization. Recent work has used simulated annealing [14], boundary matching [15] grouping of polygons into sub rectangles [1] genetic algorithms [4] incremental approach [24] database driven layout [16,18] or a hybrid approach [12,13] See [7,9] for surveys of older work. Many of these approaches either discretize the search space, replace the ....
P. Jain, P. Fenyes, R. Richter, Optimal blank nesting using simulated annealing, J. Mech. Design 114 (1) (1992) 160--165.
....if there is no solution. According to our sources in the apparel industry, available layout software is limited in practice to falling about 5 behind humans in cloth utilization. There are a number of surveys of packing nesting heuristics [7,10 12,36,38] Recent work has used simulated annealing [21], boundary matching [22] grouping of polygons into sub rectangles [13] genetic algorithms [5] database driven layout [23,24] or a hybrid approach [18,19,34,37] Heuristic approaches have been tailored to sheet metal [35] and leather [20] both of which permit rotations. Chazelle [6] ....
P. Jain, P. Fenyes, R. Richter, Optimal blank nesting using simulated annealing, J. Mech. Design 114 (1) (1992) 160--165.
....which resist optimization by traditional gradient based techniques. Because realistic engineering problems are often characterized by poorly behaved objective functions, simulated annealing has a broad range of use. A sampling of recent applications of simulated annealing includes blank nesting (Jain et al. 1992), tolerance design (Zhang and Wang, 1993) truss design (Shea and Cagan, 1995) feature recognition (Dong and Vijayan, 1996) machine design (Schmidt and Cagan, 1996) assembly design (Kim and Szykman, 1996) tube routing (Szykman and Cagan, 1996) mechanism synthesis (Ullah and Kota, 1996) ....
Jain, P., P. Fenyes and R. Richter (1992), "Optimal Blank Nesting Using Simulated Annealing," ASME Journal of Mechanical Design, 114:160-165.
....hand have a high inertia and take longer to switch attention. Simulated Annealing has been used in several engineering design domains including communication network design [ Chardaire and Lutton 1993, Andersen et al. 1993 ] and mechanical design [ Jain and Agogino 1988, Malhotra et al. 1991, Jain et al. 1992, Cagan and Kurfess 1992 ] There has been a long philosophical argument about which is better: SAs or GAs. We believe that this is problem dependent. In the case of engineering design optimization, however, GAs are more likely to win because of the fact that they maintain a whole population of ....
P. Jain, P. Fenyes, and R. Richter. Optimal blank nesting using simulated annealing. ASME Journal of Mechanical Design, 114:160--165, 1992. 103
....grouping. In the 3 D bin packing problem, the goal is to minimize the volume of a single orthogonal 3 D bin containing arbitrary dimensional 3 D boxes into it [22,26] In the 2 D nesting problem, the goal is to maximize the number of arbitrary shaped elements embedded into a single orthogonal bin [27 30]. It is often 2 allowed to turn the elements during the process. Our methodology is expected to produce good solutions more efficiently than other techniques. This is very important, because the problems are NP hard. For example, reasonable approximation algorithms for the bin packing problem ....
....each with an optimal arrangement for multiple similar pieces. By restricting the variety of shapes to be manipulated, the authors managed to reduce the problem size. However, Patnest ship may provide rather poor solutions if highly irregular shapes are present. One of the most critical topics in [30] is the actual nesting, or positioning, of the part blanks onto the metal strip or sheet stock. They developed an automated system based on mathematical programming techniques which optimize blank nesting for a continuous strip stamping processes. Efficient nesting of blanks on a coil of metal is ....
[Article contains additional citation context not shown here]
Jain, P., Fenyes, P., and Richter, R., "Optimal blank nesting using simulated annealing", in Proc. Advances in Design Automation, vol.2, ASME 1991, pp. 109 - 116.
....is no solution. According to our sources in the apparel industry, available layout software is limited in practice to falling about 5 behind humans in cloth utilization. There are a number of surveys of packing nesting heuristics [11, 7, 38, 10, 36, 12] Recent work has used simulated annealing [21], boundary matching [22] grouping of polygons into sub rectangles [13] genetic algorithms [5] database driven layout [23, 24] or a hybrid approach [18, 19, 37, 34] Heuristic approaches have been tailored to sheet metal [35] and leather [20] both of which permit rotations. Chazelle [6] ....
P. Jain, P. Fenyes, and R. Richter. Optimal blank nesting using simulated annealing. Journal of mechanical design, 114(1):160--165, March 1992.
....and meta heuristics are limited in theory because they cannot say no if there is no solution. According to our sources in the apparel industry, available layout software is limited in practice to falling about 5 behind humans in cloth utilization. Recent work has used simulated annealing [14], boundary matching [15] grouping of polygons into sub rectangles [9] genetic algorithms [3] incremental approach [24] database driven layout [16,18] or a hybrid approach [12,13] See [8,6] for surveys of older work. Many of these approaches either discretize the search space, replace the ....
P. Jain, P. Fenyes, and R. Richter. Optimal blank nesting using simulated annealing. Journal of mechanical design, 114(1):160--165, March 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC