Hostname: page-component-77f85d65b8-45ctf Total loading time: 0 Render date: 2026-04-20T09:53:10.464Z Has data issue: false hasContentIssue false

Optimized process planning by generative simulated annealing

Published online by Cambridge University Press:  27 February 2009

K.N. Brown
Affiliation:
Department of Computing Science, University of Aberdeen, Aberdeen AB24 3UE, U.K.
J. Cagan
Affiliation:
Department of Mechanical Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A.

Abstract

Manufacturing process planning is a difficult problem with a prohibitively large search space. It is normally tackled by decomposing goal objects into features, and then sequencing features to obtain a plan. This paper investigates an alternative approach. The capabilities of a manufacturing process are represented by a formal language of shape, in which sentences correspond to manufacturable objects. The language is interpreted to describe process plans corresponding to the shape generation, complete with cost estimates. A macro layer that describes single operations of the machine is implemented on top of the formal language. The space it describes is searched by the generative simulated annealing algorithm, a stochastic search technique based on simulated annealing. Plans that are close to the optimum are generated in reasonable time.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable