Abstract
Ant Colony Optimization is a stochastic search method that mimic the social behavior of real ants colonies, which manage to establish the shortest routs to feeding sources and back. Such algorithms have been developed to arrive at near-optimum solutions to large-scale optimization problems, for which traditional mathematical techniques may fail. In this paper on each iteration estimations of the start nodes of the ants are made. Several start strategies are prepared and combined. Benchmark comparisons among the strategies are presented in terms of quality of the results. Based on this comparison analysis, the performance of the algorithm is discussed along with some guidelines for determining the best strategy. The study presents ideas that should be beneficial to both practitioners and researchers involved in solving optimization problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Diffe, W., Hellman, M.E.: New direction in cryptography. IEEE Trans. Inf. Theory IT-36, 644–654 (1976)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Fidanova, S.: Evolutionary algorithm for multiple knapsack problem. In: Int. Conference Parallel Problems Solving from Nature, Real World Optimization Using Evolutionary Computing, Granada, Spain (2002) ISB 0-9543481-0-9
Fidanova, S.: Ant colony optimization and multiple knapsack problem. In: Renard, J.P. (ed.) Handbook of Research on Nature Inspired Computing for Economics ad Management, pp. 498–509. Idea Grup Inc., USA (2006)
Lessing, L., Dumitrescu, I., Stutzle, T.: A comparison between ACO algorithms for the set covering problem. In: ANTS Workshop, pp. 1–12 (2004)
Martello, S., Toth, P.: A mixtures of dynamic programming and branch-and-bound for the subset-sum problem. Management Science 30, 756–771 (1984)
Reiman, M., Laumanns, M.: A hybrid ACO algorithm for the capacitate minimum spanning tree problem. In: Workshop on Hybrid Metahuristics, Valencia, Spain, pp. 1–10 (2004)
Sinha, A., Zoltner, A.A.: The multiple-choice knapsack problem. J. Operational Research 27, 503–515 (1979)
Stutzle, T., Dorigo, M.: ACO algorithm for the traveling salesman problem. In: Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.) Evolutionary Algorithms in Engineering and Computer Science, pp. 163–183. Wiley, Chichester (1999)
Zhang, T., Wang, S., Tian, W., Zhang, Y.: ACO-VRPTWRV: A new algorithm for the vehicle routing problems with time windows and re-used vehicles based on ant colony optimization. In: Conference on Intelligent Systems Design and Applications, pp. 390–395. IEEE press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fidanova, S., Atanassov, K., Marinov, P. (2011). Start Strategies of ACO Applied on Subset Problems. In: Dimov, I., Dimova, S., Kolkovska, N. (eds) Numerical Methods and Applications. NMA 2010. Lecture Notes in Computer Science, vol 6046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18466-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-18466-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18465-9
Online ISBN: 978-3-642-18466-6
eBook Packages: Computer ScienceComputer Science (R0)