Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms

Sheldon H. Jacobson, Kelly A. Sullivan, Alan W. Johnson

Research output: Contribution to journalArticle

Abstract

Discrete manufacturing process designs can be modelled using computer simulation. Determining optimal designs using such models is very difficult, due to the large number of manufacturing process sequences and associated parameter settings that exist. This has forced researchers to develop heuristic strategies to address such design problems. This paper introduces a new general heuristic strategy for discrete manufacturing process design optimization, called generalized hill climbing (GHC) algorithms. GHC algorithms provide a unifying approach for addressing such problems in particular, and intractable discrete optimization problems in general. Heuristic strategies such as simulated annealing, threshold accepting, Monte Carlo search, local search, and tabu search (among others) can all be formulated as GHC algorithms. Computational results are reported with various GHC algorithms applied to computer simulation models of discrete manufacturing process designs under study at the Materials Process Design Branch of Wright Laboratory, Wright Patterson Air Force Base (Dayton, Ohio, USA).

Original languageEnglish (US)
Pages (from-to)247-260
Number of pages14
JournalEngineering Optimization
Volume31
Issue number2
StatePublished - Dec 1 1999

Keywords

  • Hill climbing
  • Manufacturing
  • Stochastic algorithms

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms'. Together they form a unique fingerprint.

  • Cite this