Wiki
Clone wikiOscaR / release note 3.1.0
== 3.1.0 ==
CP
- Compact table and efficient implem of various tables algorithm: Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles RĂ©gin, Pierre Schaus. Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets.
- Nested-gcc: Cyrille Dejemeppe, Olivier Devolder, Victor Lecomte, Pierre Schaus. Forward-Checking filtering for Nested Cardinality Constraints: Application to an Energy Cost Aware Production Planning Problem for Tissue Manufacturing (CPAIOR2016)
- New reified table constraint
- New negative table constraint
- Perf improvement alldiff-ac
- Remove old search
- Perf improvement delta computation
- Implem of reversible sparse-bit-set data structures
- Bug fix gcc forward checking (occurring on magic sequence)
- Bug fix LNS (occuring when the fragment failed at its definition)
CBLS
- more search combinators: cross product with symmetry breaking, hill climbing, restart
- more standard neighbourhoods: widening flip, sift and some randomization
- a few additional examples (car sequencing, flowShop)
- minor speed improvement for the set variables
Also, vehicle routing is considered deprecated and should be replaced in the coming release with a more efficient model.
Updated