This page is for an old version of Hexaly Optimizer.
We recommend that you update your version and read the documentation for the
latest stable release .
Hexaly
LocalSolver 6.5
Release notes
For models involving list variables, new moves have been introduced to
better manage constraints based on count
, indexOf
or partition
expressions. These moves are particularly effective on routing and
scheduling problems.
For near-linear (discrete or continuous) problems, new moves have been
introduced based on linear programming and mixed-integer linear
programming techniques. These moves allow to intensify the search on
near-linear models by exploring optimally larger neighborhoods.