|
ILOG CP Optimizer has many advanced features to help you save time and increase efficiency. |
|
An efficient and precise modeling language specifically designed for allocation, sequencing and timetabling problems
ILOG CP Optimizer provides arithmetic linear and non-linear constraints, logical constraints and specialized constraints that define relationships between a large set of variables. Supported constraints and expressions include:
- The all-different constraint: enforces uniqueness for each variable in an array
- The pack constraint: packs items into containers with finite capacity in one dimension (time, weight, budget etc.)
- The lexicographic constraint: enforces a lexical ordering between groups of decision variables and is convenient to break symmetries
- The count expression
- The standard deviation expression
- Compatibility and incompatibility constraints: define possible assignments for arrays of decision variables. They can be used, for instance, to model allowed transitions in a sequencing problem.
"Model and run" development processes
ILOG CP Optimizer includes both a constraint propagation engine and a solution search engine that drives to feasibility and then improves the solution until it finds the best one. It eliminates the need to write a search strategy—something that has been required in all traditional CP engines, including ILOG’s earlier generation products. With ILOG CP Optimizer, the model you develop can be executed without writing search instructions, providing the same user experience as ILOG CPLEX provides for MP models.
Fast “feasible solution” generator
ILOG CP Optimizer solution search technology is based on a constructive search technique that builds and improves solutions after a sequence of decisions on the possible values of each individual variable.
ILOG CP Optimizer provides a fast “feasible solution” generator that can be used in combination with ILOG CPLEX when problem composition and multi-model solutions are the best options. In a multi-model architecture, an ILOG CP Optimizer model serves as a column generator for a second ILOG CPLEX model.
Tunable optimization engine
ILOG CP Optimizer provides robust search algorithms that automatically explore the solution space, based on a mathematical formulation of the constraints. It is possible to tune these search algorithms by declaring search phrases and by taking advantage of parameters that specify emphasis on certain search algorithms or strength of propagation for a category of constraints.
Works with the ILOG OPL-CPLEX-ODM Development System
ILOG CP Optimizer has been designed to take full advantage of the ILOG OPL-CPLEX-ODM Development System. CP models built in this environment can be tested, debugged and tuned in the same way as ILOG CPLEX models. In fact, the ILOG CPLEX Conflict Refiner is the only major tool in the system not available to CP Optimizer models. And CP models built this way can be rapidly turned into ODM-based decision support applications for business users.
Interfaces in C++, Java, C#
ILOG CP Optimizer provides advanced programming interfaces (APIs) for C++, Java and C#. Developers can create a model, run the engine, and write custom propagator functions and search controls using any of these languages.
Advanced application programming interface (API) for writing custom search procedures
ILOG CP Optimizer provides an advanced API in C++ to write custom search procedures. Experienced CP developers and researchers can write their own search strategies to accelerate solving times. This API also facilitates the migration of ILOG CP-based models (models built using ILOG Solver) to the ILOG CP Optimizer architecture.
|
