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]

Issue Section:
Technical Papers
Keywords:
design for manufacture, optimisation, manufacturing processes, engineering computing, Manufacturing, Design, Stochastic Algorithms, Optimization, Hill Cimbing
Topics:
Algorithms, Design, Manufacturing, Optimization, Probability
1.
Jacobson
,
S. H.
,
Sullivan
,
K. A.
, and
Johnson
,
A. W.
,
1998
, “
Discrete Manufacturing Process Design Optimization Using Computer Simulation and Generalized Hill Climbing Algorithms
,”
Eng. Opt.
,
31
, pp.
247
–
260
.
2.
Johnson, A. W., and Jacobson, S. H., 2000, “On the Convergence of Generalized Hill Climbing Algorithms,” Technical Report, University of Illinois, Urbana, Illinois.
3.
Gunasekera, J. S., Fischer, C. E., Malas, J. C., Mullins, W. M., and Yang, M. S., 1996, “Development of Process Models for Use with Global Optimization of a Manufacturing System,” Proceedings of the ASME Symposium on Modeling, Simulation and Control of Metal Processing, ASME-International Mechanical Engineering Congress, Atlanta, GA, Nov. 1996.
4.
Fischer, C. E., Gunasekera, J. S., and Malas, J. C., 1997, “Process Model Development for Optimization of Forged Disk Manufacturing Processes,” Steel Forgings, Second Volume, ASTM STP 1257, E. G. Nisbett and A. S. Melilli, Editors, American Society for Testing and Materials.
5.
Johnson, A. W., and Jacobson, S. H., 2000, “A Class of Convergent Generalized Hill Climbing Algorithms,” Appl. Math. Comput. (accepted).
6.
Eglese
,
R. W.
,
1990
, “
Simulated Annealing: A Tool for Operational Research
,”
Eur. J. Oper. Res.
,
46
, pp.
271
–
281
.
7.
Fleischer, M. A., 1995, “Simulated Annealing: Past, Present, and Future,” Proceedings of the 1995 Winter Simulation Conference, pp. 155–161.
8.
Dueck
,
G.
, and
Scheuer
,
T.
,
1990
, “
Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing
,”
J. Comput. Phys.
,
90
, pp.
161
–
175
.
9.
Glover, F., and Laguna, M., 1997, Tabu Search, Kluwer Academic, Norwell, Massachusetts.
10.
Law, A. M., and Kelton, W. D., 1991, Simulation Modeling and Analysis, second Edition, McGraw-Hill, New York.
11.
Devroye, L., 1986, Non-Uniform Random Variate Generation, Springer-Verlag, New York.
12.
Royden, H. L., 1988, Real Analysis, third edition, Prentice Hall, New Jersey.
Copyright © 2000
 by ASME
You do not currently have access to this content.