A new solution algorithm for improving performance of ant colony optimization. (English) Zbl 1162.90590
Summary: This study proposes an improved solution algorithm using ant colony optimization (ACO) for finding global optimum for any given test functions. The procedure of the ACO algorithms simulates the decision-making processes of ant colonies as they forage for food and is similar to other artificial intelligent techniques such as Tabu search, Simulated Annealing and Genetic Algorithms. ACO algorithms can be used as a tool for optimizing continuous and discrete mathematical functions. The proposed algorithm is based on each ant searches only around the best solution of the previous iteration with \(\beta \). The proposed algorithm is called as ACORSES, an abbreviation of ACO Reduced SEarch Space. \(\beta \) is proposed for improving ACO’s solution performance to reach global optimum fairly quickly. The ACORSES is tested on fourteen mathematical test functions taken from literature and encouraging results were obtained. The performance of ACORSES is compared with other optimization methods. The results showed that the ACORSES performs better than other optimization algorithms, available in literature in terms of minimum values of objective functions and number of iterations.
MSC:
| 90C59 | Approximation methods and heuristics in mathematical programming |
| 65K05 | Numerical mathematical programming methods |
References:
| [1] | Toksarı, M. D., Ant colony optimization for finding the global minimum, Applied Mathematics and Computation, 176, 308-316 (2006) · Zbl 1093.65065 |
| [2] | Toksarı, M. D., A heuristic approach to find the global optimum of function, Journal of Computational and Applied Mathematics, 209, 2, 160-166 (2007) · Zbl 1134.65351 |
| [3] | Hamzacebi, C.; Kutay, F., A heuristic approach for finding the global minimum: adaptive random search technique, Applied Mathematics and Computation, 173, 2, 1323-1333 (2006) · Zbl 1088.65058 |
| [4] | Li, J.; Rhinehart, R. R., Heuristic random optimization, Computers and Chemical Engineering, 22, 3, 427-444 (1998) |
| [5] | Hamzacebi, C., Improving genetic algorithms’ performance by local search for continuous function optimization, Applied Mathematics and Computation, 196, 309-317 (2008) · Zbl 1133.65031 |
| [6] | Hamzacebi, C., Continuous functions minimization by dynamic random search technique, Applied Mathematical Modelling, 31, 2189-2198 (2007) · Zbl 1165.90482 |
| [7] | Kwon, Y. D.; Kwon, S. B.; Kim, J., Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Computers and structures, 81, 1715-1725 (2003) |
| [8] | M. Dorigo, G. Di Caro, Ant colony optimisation: a new meta-heuristic, in: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, 1999, pp. 1470-1477.; M. Dorigo, G. Di Caro, Ant colony optimisation: a new meta-heuristic, in: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 2, 1999, pp. 1470-1477. |
| [9] | Donati, A. V.; Montemanni, R.; Casagrande, N.; Rizzoli, A. E.; Gambardella, L. M., Time dependent vehicle routing problem with a multi ant colony system, European Journal of Operational Research, 185, 3, 1174-1191 (2008) · Zbl 1146.90328 |
| [10] | Bell, J. E.; McMullen, P. R., Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics, 18, 41-48 (2004) |
| [11] | Talbi, E. G.; Roux, O.; Fonlupt, C.; Robillard, D., Parallel ant colonies for the quadratic assignment problem, Future Generation Computer Systems, 17, 441-449 (2001) · Zbl 1016.68170 |
| [12] | Demirel, N. C.; Toksari, M. D., Optimization of the quadratic assignment problem using an ant colony algorithm, Applied Mathematics and Computation, 183, 427-435 (2006) · Zbl 1105.65329 |
| [13] | Dreo, J.; Siarry, P., An ant colony algorithm aimed at dynamic continuous optimization, Applied Mathematics and Computation, 181, 457-467 (2006) · Zbl 1155.65349 |
| [14] | Kuan, S. N.; Ong, H. L.; Ng, K. M., Solving the feeder bus network design problem by genetic algorithms ad ant colony optimization, Advances in Engineering Software, 37, 351-359 (2006) |
| [15] | Poorzahedy, H.; Abulghasemi, F., Application of Ant system to network design problem, Transportation, 32, 251-273 (2005) |
| [16] | Wang, H.; Shen, J., Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints, Applied Mathematics and Computation, 190, 1237-1249 (2007) · Zbl 1119.90079 |
| [17] | Cheng, C. B.; Mao, C. P., A modified ant colony system for solving the travelling salesman problem with time windows, Mathematical and Computer Modelling, 46, 1225-1235 (2007) · Zbl 1173.90562 |
| [18] | Schwefel, H. P., Numerical Optimization of Computer Models (1981), Wiley & Sons: Wiley & Sons Chichester · Zbl 0451.65043 |
| [19] | M. Dorigo, T. Stützle, Ant Colony Optimization, MIT Press, Massachusetts Institute of Technology, Cambridge, 2004.; M. Dorigo, T. Stützle, Ant Colony Optimization, MIT Press, Massachusetts Institute of Technology, Cambridge, 2004. · Zbl 1092.90066 |
| [20] | M. Dorigo, Optimization, learning and natural algorithms, Ph.D. Thesis, Politecnico di Milano, Italy, 1992.; M. Dorigo, Optimization, learning and natural algorithms, Ph.D. Thesis, Politecnico di Milano, Italy, 1992. |
| [21] | Denebourg, J. L.; Pasteels, J. M.; Verhaeghe, J. C., Probabilistic behaviour in ants: a strategy of errors?, Journal of Theoretical Biology, 10, 259-271 (1983) |
| [22] | Shelokar, P. S.; Siarry, P.; Jayaraman, V. K.; Kulkarni, B. D., Particle swarm and ant colony algorithms hybridized for improved continuous optimization, Applied Mathematics and Computation, 188, 129-142 (2007) · Zbl 1114.65334 |
| [23] | Toksari, M. D., Minimizing the multimodal functions with ant colony optimization approach, Expert Systems with Applications, 36, 6030-6035 (2009) |
| [24] | Chelouah, R.; Siarry, P., Tabu Search applied to global optimization, European Journal of Operational Research, 123, 256-270 (2000) · Zbl 0961.90037 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
