DISCRETE MANUFACTURING PROCESS DESIGN OPTIMIZATION USING COMPUTER SIMULATION AND GENERALIZED HILL CLIMBING ALGORITHMS

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 generalised 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 he 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).

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 38 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.