Simulated annealing and parallel processing: An implementation for constrained global design optimization

Mir M. Atiqullah, Singiresu S Rao

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Global optimization becomes important as more and more complex designs are evaluated and optimized for superior performance. Often parametric designs are highly constrained, adding complexity to the design problem. In this work simulated annealing (SA), a stochastic global optimization technique, is implemented by augmenting it with a feasibility improvement scheme (FIS) that makes it possible to formulate and solve a constrained optimization problem without resorting to artificially modifying the objective function. The FIS is also found to help recover from the infeasible design space rapidly. The effectiveness of the improved algorithm is demonstrated by solving a welded beam design problem and a two part stamping optimization problem. Large scale practical design problems may prohibit the efficient use of computationally intensive iterative algorithms such as SA. Hence the FIS augmented SA algorithm is implemented on an Intel iPSC/860 parallel super-computer using a data parallel structure of the algorithm for the solution of large scale optimization problems. The numerical results demonstrate the effectiveness of the FIS as well as the parallel version of the SA algorithm. Expressions are developed for the estimation of the speedup of iterative algorithms running on a parallel computer with hyper-cube interconnection topology. Computational speedup in excess of 8 is achieved using 16 processors. The timing results given for the example problems provide guidelines to designers in the use of parallel computers for iterative processes.

Original languageEnglish
Pages (from-to)659-685
Number of pages27
JournalEngineering Optimization
Volume32
Issue number5
StatePublished - Jan 1 2000

Fingerprint

Parallel Processing
Simulated annealing
Simulated Annealing
Global Optimization
Processing
Simulated Annealing Algorithm
Parallel Computers
Iterative Algorithm
Global optimization
Speedup
Parametric Design
Optimization Problem
Large-scale Optimization
Stochastic Optimization
Supercomputer
Large-scale Problems
Iterative Process
Constrained Optimization Problem
Interconnection
Stamping

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Engineering (miscellaneous)

Cite this

Simulated annealing and parallel processing : An implementation for constrained global design optimization. / Atiqullah, Mir M.; Rao, Singiresu S.

In: Engineering Optimization, Vol. 32, No. 5, 01.01.2000, p. 659-685.

Research output: Contribution to journalArticle

@article{a164c7fc32d04f6a8cf64ce376f5cd38,
title = "Simulated annealing and parallel processing: An implementation for constrained global design optimization",
abstract = "Global optimization becomes important as more and more complex designs are evaluated and optimized for superior performance. Often parametric designs are highly constrained, adding complexity to the design problem. In this work simulated annealing (SA), a stochastic global optimization technique, is implemented by augmenting it with a feasibility improvement scheme (FIS) that makes it possible to formulate and solve a constrained optimization problem without resorting to artificially modifying the objective function. The FIS is also found to help recover from the infeasible design space rapidly. The effectiveness of the improved algorithm is demonstrated by solving a welded beam design problem and a two part stamping optimization problem. Large scale practical design problems may prohibit the efficient use of computationally intensive iterative algorithms such as SA. Hence the FIS augmented SA algorithm is implemented on an Intel iPSC/860 parallel super-computer using a data parallel structure of the algorithm for the solution of large scale optimization problems. The numerical results demonstrate the effectiveness of the FIS as well as the parallel version of the SA algorithm. Expressions are developed for the estimation of the speedup of iterative algorithms running on a parallel computer with hyper-cube interconnection topology. Computational speedup in excess of 8 is achieved using 16 processors. The timing results given for the example problems provide guidelines to designers in the use of parallel computers for iterative processes.",
author = "Atiqullah, {Mir M.} and Rao, {Singiresu S}",
year = "2000",
month = "1",
day = "1",
language = "English",
volume = "32",
pages = "659--685",
journal = "Engineering Optimization",
issn = "0305-215X",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

TY - JOUR

T1 - Simulated annealing and parallel processing

T2 - An implementation for constrained global design optimization

AU - Atiqullah, Mir M.

AU - Rao, Singiresu S

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Global optimization becomes important as more and more complex designs are evaluated and optimized for superior performance. Often parametric designs are highly constrained, adding complexity to the design problem. In this work simulated annealing (SA), a stochastic global optimization technique, is implemented by augmenting it with a feasibility improvement scheme (FIS) that makes it possible to formulate and solve a constrained optimization problem without resorting to artificially modifying the objective function. The FIS is also found to help recover from the infeasible design space rapidly. The effectiveness of the improved algorithm is demonstrated by solving a welded beam design problem and a two part stamping optimization problem. Large scale practical design problems may prohibit the efficient use of computationally intensive iterative algorithms such as SA. Hence the FIS augmented SA algorithm is implemented on an Intel iPSC/860 parallel super-computer using a data parallel structure of the algorithm for the solution of large scale optimization problems. The numerical results demonstrate the effectiveness of the FIS as well as the parallel version of the SA algorithm. Expressions are developed for the estimation of the speedup of iterative algorithms running on a parallel computer with hyper-cube interconnection topology. Computational speedup in excess of 8 is achieved using 16 processors. The timing results given for the example problems provide guidelines to designers in the use of parallel computers for iterative processes.

AB - Global optimization becomes important as more and more complex designs are evaluated and optimized for superior performance. Often parametric designs are highly constrained, adding complexity to the design problem. In this work simulated annealing (SA), a stochastic global optimization technique, is implemented by augmenting it with a feasibility improvement scheme (FIS) that makes it possible to formulate and solve a constrained optimization problem without resorting to artificially modifying the objective function. The FIS is also found to help recover from the infeasible design space rapidly. The effectiveness of the improved algorithm is demonstrated by solving a welded beam design problem and a two part stamping optimization problem. Large scale practical design problems may prohibit the efficient use of computationally intensive iterative algorithms such as SA. Hence the FIS augmented SA algorithm is implemented on an Intel iPSC/860 parallel super-computer using a data parallel structure of the algorithm for the solution of large scale optimization problems. The numerical results demonstrate the effectiveness of the FIS as well as the parallel version of the SA algorithm. Expressions are developed for the estimation of the speedup of iterative algorithms running on a parallel computer with hyper-cube interconnection topology. Computational speedup in excess of 8 is achieved using 16 processors. The timing results given for the example problems provide guidelines to designers in the use of parallel computers for iterative processes.

UR - http://www.scopus.com/inward/record.url?scp=0033700560&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033700560&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033700560

VL - 32

SP - 659

EP - 685

JO - Engineering Optimization

JF - Engineering Optimization

SN - 0305-215X

IS - 5

ER -