Two-Stage Algorithm for Determination of the Bending Sequence in Sheet Metal Products

[+] Author and Article Information
B. Radin, M. Shpitalni, I. Hartman

Laboratory for Computer Graphics and CAD, Technion-Israel Institute of Technology, Haifa, Israel 32000

J. Mech. Des 119(2), 259-266 (Jun 01, 1997) (8 pages) doi:10.1115/1.2826245 History: Received May 01, 1996; Revised January 01, 1997; Online December 11, 2007


This paper presents an algorithm for solving the complex and critical problem of bending sequence in sheet metal manufacturing. Finding the bending sequence and required tool assignment presents a large combinatorial problem which is impossible to solve optimally for practical applications within a reasonable period of time. The paper presents a two-stage algorithm. The first stage finds a feasible solution based upon collision avoidance heuristics. The second stage rapidly seeks an alternative feasible sequence with a lower cost without exceeding time limitations. The algorithm is very practical because it reaches a low-cost solution quickly within computer memory limitations. In this paper, the problem is defined, the approach is presented formally, and finally, the power of the algorithm is demonstrated by solving bending sequences for real products.

Copyright © 1997 by The American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In