Computational Intelligence and Neuroscience / 2016 / Article / Tab 2

Research Article

Solving the Traveling Salesman’s Problem Using the African Buffalo Optimization

Table 2

Experimental parameters.

ABOACOABCHACGAS
ParameterValuesParametersValuesParametersValuesParametersValuesParameterValues

Population40AntsPopulationPopulationGeneration100
1.0β5.0ϕijrand(−1, 1)β5.0β2.0
max/max0.6ρ0.65ωijrand(0, 1.5)ρ0.65ρ0.1
0.5α1.0SNNP/2α1.00.33
1.0Ǫ200Limitϕijrand(−1, 1)Crossover rate1.0
N/Aqo0.9Max cycle number500ωijrand(0, 1.5)qo0.9
N/AN/AColony50 SNNP/2ϕ0.3
N/AN/AN/ALimitϕρ0.2
N/AN/AN/AMax cycle number500
N/AN/AN/AColony50
N/AN/AN/AǪ200N/A
N/AN/AN/Aqo0.9N/A
Total number of runs5050505050