dynamically dimensioned search

sharma-n · May 23, 2020 · 0c8f98c · 0c8f98c
1 parent 5f3d127
commit 0c8f98c
Show file tree

Hide file tree

Showing 4 changed files with 240 additions and 4 deletions.
diff --git a/.gitignore b/.gitignore
@@ -1,4 +1,7 @@
 .ipynb_checkpoints/*
 **/__pycache__/*
 **/*.mp4
-.vscode/
+.vscode/
+output/
+10. Surrogate Optimization.ipynb
+text_generation.ipynb
diff --git a/9. DDS.ipynb b/9. DDS.ipynb
diff --git a/Images/reflected_gaussian.png b/Images/reflected_gaussian.png
diff --git a/README.md b/README.md
@@ -9,6 +9,7 @@ Global optimization attempts to find the global minima / maxima of a function or
 * Genetic Algorithms for Path Finding and Travelling Salesman Problem
 * Multi Objective Optimization using Elitist Non-Dominated Sorting Genetic Algorithm (NSGA-II)
 * Tabu Search for Travelling Salesman Problem and Capacitated Vehicle Routing Problem
+* Dynamically Dimensioned Search (DDS)
 
 ## Some visualizations
 * **Simulated Annealing:** Below we see the comparison between simulated annealing (SA) and greedy search (GS) on an example objective. The search algorithm attempts to minimize the function based on two variables. In the image, green areas are maximas and purple areas are minimas, with the intensity representing magnitude.