Penalty-free method for multi-constrained optimization problems based on parallel simulated annealing

David J. Kropaczek

Research output: Contribution to journalConference articlepeer-review

Abstract

A method is presented for addressing constraints within the context of large-scale combinatorial optimization problems. The method, based on constraint annealing, eliminates the use of traditional constraint penalty factors by treating each constraint as separate and concurrently solved minimization problems within a global optimization search framework. Results are demonstrated for a core loading pattern optimization problem.

Original languageEnglish
Pages (from-to)543-548
Number of pages6
JournalTransactions of the American Nuclear Society
Volume115
StatePublished - 2016
Externally publishedYes
Event2016 Transactions of the American Nuclear Society, ANS 2016 - Las Vegas, United States
Duration: Nov 6 2016Nov 10 2016

Fingerprint

Dive into the research topics of 'Penalty-free method for multi-constrained optimization problems based on parallel simulated annealing'. Together they form a unique fingerprint.

Cite this