9.12. Allocate From Pool

9.12.1. Algorithm Description

Allocate From Pool is a versatile, generic form of Cheapest Insertion and Regret Insertion. It works like this:
  1. Put all entity-value combinations in a pool.
  2. Assign the best entity to best value.
  3. Repeat until all entities are assigned.

9.12.2. Configuration

Simple configuration: 
  <constructionHeuristic>
    <constructionHeuristicType>ALLOCATE_FROM_POOL</constructionHeuristicType>
  </constructionHeuristic>
Verbose simple configuration: 
  <constructionHeuristic>
    <constructionHeuristicType>ALLOCATE_FROM_POOL</constructionHeuristicType>
    <entitySorterManner>DECREASING_DIFFICULTY_IF_AVAILABLE</entitySorterManner>
    <valueSorterManner>INCREASING_STRENGTH_IF_AVAILABLE</valueSorterManner>
  </constructionHeuristic>
The entitySorterManner and valueSorterManner options are described in Allocate Entity From Queue.
Advanced detailed configuration. For example, a Cheapest Insertion configuration for a single entity class with a single variable: 
  <constructionHeuristic>
    <pooledEntityPlacer>
      <changeMoveSelector>
        <entitySelector id="placerEntitySelector">
          <cacheType>PHASE</cacheType>
          <selectionOrder>SORTED</selectionOrder>
          <sorterManner>DECREASING_DIFFICULTY</sorterManner>
        </entitySelector>
        <valueSelector>
          <cacheType>PHASE</cacheType>
          <selectionOrder>SORTED</selectionOrder>
          <sorterManner>INCREASING_STRENGTH</sorterManner>
        </valueSelector>
      </changeMoveSelector>
    </pooledEntityPlacer>
  </constructionHeuristic>
Per step, the PooledEntityPlacer applies the winning Move (out of all the moves for that entity generated by the MoveSelector).
To customize the entity or value sorting, see sorted selection. Other Selector customization (such as filtering and limiting) is supported too.