1
0
Fork
You've already forked brakey
0

Add simulated annealing optimization method #7

Open
opened 2026年02月23日 03:39:42 +01:00 by UserCurt · 0 comments

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 Branch/Tag specified
main
No results found.
Milestone
Clear milestone
No items
No milestone
Projects
Clear projects
No items
No project
Assignees
Clear assignees
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
Reference in a new issue
UserCurt/brakey
No description provided.
Delete branch "%!s()"

Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?