Recently I was reading about GA and PSO. Wanted to know the exact motivation that lead to GA and PSO. Could you please give some examples, which cannot be solved by conventional method and hence require PSO or GA to do that. (I prefer easy to understand examples, internet provides relatively complex examples difficult to understand)
Recently I was reading about GA and PSO. Wanted to know the exact motivation that lead to GA and PSO. Could you please give some examples, which cannot be solved by conventional method and hence require PSO or GA to do that. (I prefer easy to understand examples, internet provides relatively complex examples difficult to understand)
Suppose there are 'n' blocks or modules .
Each module is connected with other module with varying
connections.
What is the best arrangement of or permutations of 'n'
modules such that their total connections of all modules are minimum?
Bit of googling and came with three types of problems that can exist (and its mixtures). They are decision problems, search and optimization problems. There are tons of methods to address those issues. Being a novice, I would like to systematically elevate myself in these concepts. Could you suggest a reference, where traditional derivative or even non derivative methods are used to solve the problems and some comparison are made to provide merits and demerits of the methods used. I guess convergence would be the benchmark in comparison
convergence is the criteria. But at what rate?
converging to acceptable solution (error delta) in
reasonable time.
That time is accepted based on the problem at hand.