What to do for the new paper

[JJ]

Several possible things have been discussed (and were not eventually used on the current paper):

• 1 on replacement policies (by @juanluck )

• 2 scale-up mixer

• 7 to work on different, possibly more general, policies. In general, migration policies should be examined.

• 5 Batched individual concurrency, which should avoid the algorithmic problems of the other kind.

• 3 Examine the biological inspiration, and maybe tap from it, by @Sargaleano

• 4 Test other algorithms, running in different threads.

Any other idea?

[Sargaleano]

Trying other benchmark functions such as p-peaks, traps and RoyalRoads or easier ones like one-blocks

[JJ]

Any reference to one-blocks?

[Sargaleano]

They are in the book of Sean Luke: Essentials of Metaheuristics (Luke, 2009), page 201.

[Sargaleano]

Another idea, maybe not for the next but for a future paper, is to move towards continuous domains... Here, again, several benchmarks can be considered.

[JJ]

@Sargaleano That might be hard, considering how we create messages. But interesting too.

[JJ]

We need to work on this a little bit harder...