Algorithm Problems

1. Condition

1.1. Termination condition

1.2. Hill climbing

1.2.1. Local extreme

1.3. Population

1.3.1. Initialization parameters

1.4. Computational Intractability

2. Solutions

2.1. Ranking

2.1.1. Fitness/fitness function/fitness landscape

2.2. Brute force approach convergence

3. Process & Explanation

3.1. Optimization

3.2. Heuristic

3.3. Exploration VS. Exploitation

4. I create this mind map from the starting point for the Algorithm problems for the computer science, and by sprat them into different pieces; The left-hand side is the vocabulary which relate to the problems, and the right-hand side, we have the problem with the possible solution for that specific problem. The condition part are relate to the speed of solving algorithm problems; Solution is some possible ways of solving simple problems; The process and Explanation is the part where clearly the difference and what it contains in that process of Algorithm problems. The Salesmen Problem could be solved into many ways, and in each way it contains different process and substance.

5. Salesmen Problem (Tour)

5.1. Roulette wheel selection

5.2. Simulated annealing

5.2.1. problem space

5.3. Selection strategy

5.3.1. Crossover

5.3.1.1. Mating pool

5.3.1.1.1. Elitism

5.4. Truncation selection

5.5. Tournament selection

5.5.1. combinatorial optimization

5.5.2. Offspring

5.5.2.1. Mutation

5.5.2.2. Premature converging

5.5.2.3. Novelty Search

5.6. Stochastic universal sampling