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 |