A Detailed Example of Applying Constraints on a Logistical Problem

Abstract

This article demonstrates the use of constraints to reduce the algorithmic complexity of industrial problems through a numerically detailed example. To achieve this, the article first presents the basics of algorithmic complexity and constraints as well as the types and uses of constraints. Second, the article presents a logistical example and determines its complexity. Third, constraints are applied on the problem. Fourth, the problem is modeled in a constraint programming environment and the different results received from different constraint sets are evaluated.