Scalable and fast version

[jdreo]

To gain speed, we need an objective function that can update performance estimates rather than compute them from scratch.

If the swap neighborhood proves scalable, we can try a larger one, allowing insertion/deletion.

• Partial objective function (may allow a faster search):
  • Holds the cache depending on static data (any data given as an input for the whole app).
• Solution:
  • Holds a cache depending on search data (any data given as input to the search run).
  • Serializes to/from string (using the ParadisEO interface).
• Neighbor(hood):
  • Insertion/deletion neighborhood.