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

David J. Kropaczek

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

David J. Kropaczek

Research output: Contribution to journal › Conference article › peer-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 language	English
Pages (from-to)	543-548
Number of pages	6
Journal	Transactions of the American Nuclear Society
Volume	115
State	Published - 2016
Externally published	Yes
Event	2016 Transactions of the American Nuclear Society, ANS 2016 - Las Vegas, United States Duration: Nov 6 2016 → Nov 10 2016

Cite this

@article{4fa52d07a4854242ae0332324934e759,

title = "Penalty-free method for multi-constrained optimization problems based on parallel simulated annealing",

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.",

author = "Kropaczek, \{David J.\}",

year = "2016",

language = "English",

volume = "115",

pages = "543--548",

journal = "Transactions of the American Nuclear Society",

issn = "0003-018X",

note = "2016 Transactions of the American Nuclear Society, ANS 2016 ; Conference date: 06-11-2016 Through 10-11-2016",

}

TY - JOUR

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

AU - Kropaczek, David J.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85032940054

M3 - Conference article

AN - SCOPUS:85032940054

SN - 0003-018X

VL - 115

SP - 543

EP - 548

JO - Transactions of the American Nuclear Society

JF - Transactions of the American Nuclear Society

T2 - 2016 Transactions of the American Nuclear Society, ANS 2016

Y2 - 6 November 2016 through 10 November 2016

ER -

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

Abstract

Other files and links

Fingerprint

Cite this