There are a few differences between GA and CP that I can think of:

1) GA do parallel search for the solution whereby, CP search for one solution at a time.

2) For … more»

In constraint programming (CP), we have a set of hard constraints to satisfy. CP will reduce the search space (using constraint satisfaction techniques) into the set of feaisble … more»

Thanks for the interesting thought! It is always useful to explore relationships between techniques we understand well and new techniques that we are trying to grasp.

Let … more»

Dr Looi lesson 1 examples using Evolver appears to run in cycles, at times instable with no end in sight, even with the best prior knowledge on crossover & mutation rates. CP (e … more»

First of all, for what I know, Ants choose the shortest path based on the strength of the phernomone trail. And the amt of deposit of phernomone by the ants is approx. proportio … more»

The chemical scent will grow stronger with the increased number of ants that follow the shortest path (i.e. converges to a fitness value that is deemed to be optimised). So one … more»

The ant problem may also be expanded to include optimisation of food amount, food quality and time taken to reach there(shortest path may not translate to shortest time). Provid … more»

Maybe mutation = slight deviation from original trail? Fitness function = distance of trail to target food?

Ever been bored enough to observe ants when they scavenge for food? Ants have been observed to be able to find the shortest path to their target source through a chemical trail … more»