__There will be three porblems , each using different optimization methods __
- Profit Maximization Problem
- Linear Programming
- Knaspack Combination Problem
- Random Walk
- Hill Climbing
- Genetic Algorithm
- Traveling Salesman Problem (TSP)
- Random Walk
- Hill Climbing
- Tabu Search
- Simulated Annealing
- Ant Colony Optimization
- Particle Swarm Optimization
__Code for each problem is in seperate folders, detail descriptions of the problem statements and some comments can be found in each README.md inside the folders. __
See the overall results:
- Get the answer of Problem 1 ：
python ./Problem_1/Problem1.py - Get the progress plot of Problem 2 ：
python ./Problem_2/Problem2_plot.py - Get the progress plot of Problem 3 ：
python ./Problem_3/Problem3_plot.py
See detail results using different Algorithms
- Get the answer of problem 2 using...
- Random Walk :
python ./Problem_2/Problem2_RW.py - Hill Climbing :
python ./Problem_2/Problem2_HC.py - Genetic Algorithm :
python ./Problem_2/Problem2_GA.py
- Random Walk :
- Get the answer of problem 3 using...
- Random Walk :
python ./Problem_3/Problem3_RW.py - Tabu Search :
python ./Problem_3/Problem3_TS.py - Hill Climbing :
python ./Problem_3/Problem3_HC.py - Simulated Annealing :
python ./Problem_3/Problem3_SA.py - Ant Colony Optimization :
python ./Problem_3/Problem3_ACO.py
- Random Walk :