Example: Implementing Circular Permutation

A combinatorial object is the basic entity of a local search; the object over which a search space is defined. Examples are permutations, subsets, etc. To work with a search space of solutions whose type has not been included in the system, a user must add a new combinatorial solution type. Its requirements are the same as those of existing types such as permutation, subset, etc. The basic requirements are:

• The new combinatorial object must be derived from the basic CombinatorialObject class, and must implement the pure virtual function specified there.

• Additionally, it must define other methods, in the same manner as other existing types such as permutation. Summarily, these methods include constructors that generate empty, same, and random instances, plus other basic utilities.