We are happy to announce that the fifth version of the Seeker Solver (official version 2.1) has just been released! Some highlights:
System Improvements
- Improved internal handling of permutations makes Seeker 20%-40% faster for routing problems.
- New surrogates make stochastic optimization 25-50% more efficient (for scenario numbers of up to 300).
- Seeker is now available for Python 3.8-3.13.
New Model Functionality
- New decision variable split_total(int n, int total) is now available to ask Seeker to split a given integer total among n assignees so that the sum of each share sums to the total and each share is an integer.
- New permutation variable is now available to ask Seeker to provide a permutation that fulfills given precedence constraints.
New Optimization Functionality
- New step-limited optimization is now available for fully deterministic execution on single-processor applications. This functionality works for single- and multi-objective optimization.
- New weighted multi-objective optimization now allows giving different emphasis for the various objectives.
New Debugging and Inter-Optimization Capabilities
- Assign a value to any given term.
- Freeze any term, including variables, at their current value.
- Unfreeze any previously frozen term, including variables.
- Unenforce any previously enforced constraint.
What are you waiting for? Install the best Seeker yet:
pip install ioseeker
And obtain a free evaluation license from info@insideopt.com.
The Reference Manual with all existing and new features is available at https://insideopt.com/pages/documentation.