Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="635608.fig.001a" src="https://static.hindawi.com/articles/jam/volume-2013/635608/figures/635608.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Neumann</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="635608.fig.001b" src="https://static.hindawi.com/articles/jam/volume-2013/635608/figures/635608.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Moore</td></tr></table></td></tr></table>

Journal of Applied Mathematics

fig1

Figure 1

Figure 1: Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems 