Discrete manufacturing process design optimization can be difficult, due to the large number of manufacturing process design sequences and associated input parameter setting combinations that exist. Generalized hill climbing algorithms have been introduced to address such manufacturing design problems. Initial results with generalized hill climbing algorithms required the manufacturing process design sequence to be fixed, with the generalized hill climbing algorithm used to identify optimal input parameter settings. This paper introduces a new neighborhood function that allows generalized hill climbing algorithms to be used to also identify the optimal discrete manufacturing process design sequence among a set of valid design sequences. The neighborhood function uses a switch function for all the input parameters, hence allows the generalized hill climbing algorithm to simultaneously optimize over both the design sequences and the inputs parameters. Computational results are reported with an integrated blade rotor discrete manufacturing process design problem under study at the Materials Process Design Branch of the Air Force Research Laboratory, Wright Patterson Air Force Base (Dayton, Ohio, USA). [S1050-0472(00)01002-3]
A New Neighborhood Function for Discrete Manufacturing Process Design Optimization Using Generalized Hill Climbing Algorithms
Contributed by the Design Automation Committee for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received June 1999; revised March 2000. Associated Technical Editor: A. Diaz.
- Views Icon Views
- Share Icon Share
- Search Site
Vaughan , D. E., Jacobson , S. H., and Armstrong, D. E. (March 1, 2000). "A New Neighborhood Function for Discrete Manufacturing Process Design Optimization Using Generalized Hill Climbing Algorithms ." ASME. J. Mech. Des. June 2000; 122(2): 164–171. https://doi.org/10.1115/1.533566
Download citation file: