Add simulated annealing optimization method #7

Open
opened 2026-02-23 02:39:42 +00:00 by UserCurt · 0 comments
UserCurt commented 2026-02-23 02:39:42 +00:00 (Migrated from codeberg.org)

As of this time, the suite of optimization methods include: exhaustive, local search (steepest descent and tabu), sides (not a general method), strict-finger/constrained (likely will be deprecated), nearest (projection to satisfy the given constraints, under consideration to be moved into a separate function out of optimize.py), and shuffle (not part of optimize.py but it is under consideration to be moved as part of it).

Simulated annealing is a common non-linear optimization method. This feature request suggests implementation of this method for layout design.

As of this time, the suite of optimization methods include: exhaustive, local search (steepest descent and tabu), sides (not a general method), strict-finger/constrained (likely will be deprecated), nearest (projection to satisfy the given constraints, under consideration to be moved into a separate function out of `optimize.py`), and shuffle (not part of `optimize.py` but it is under consideration to be moved as part of it). Simulated annealing is a common non-linear optimization method. This feature request suggests implementation of this method for layout design.
Sign in to join this conversation.
No milestone
No project
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set

Reference
UserCurt/brakey#7
No description provided.