Abstract
Ant Colony Optimization (ACO) has been used successfully to solve hard combinatorial optimization problems. This metaheuristic method is inspired by the foraging behavior of ant colonies, which manage to establish the shortest routes to feeding sources and back. On this work we use estimation of start nodes with respect to the quality of the solution. Various start strategies are offered. Sensitivity analysis of the algorithm behavior according strategy parameters is made. Our ideas is applied on Multiple Knapsack Problem (MKP) like a representative of the subset problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)
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)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
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) ISBN 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) ISBN 1-59140-984-5
Fidanova, S., Atanassov, K., Marinov, P., Parvathi, R.: Ant Colony Optimization for Multiple Knapsack Problems with Controlled Starts. Int. J. Bioautomation 13(4), 271–280
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 Capacitated Minimum Spanning Tree Problem. In: Proc. of First Int. 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)
Stutzle, T., Hoos, H.H.: MAX-MIN Ant System. In: Dorigo, M., Stutzle, T., Di Caro, G. (eds.) Future Generation Computer Systems, vol. 16, pp. 889–914 (2000)
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: Sixth International 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., Marinov, P., Atanassov, K. (2011). Sensitivity Analysis of ACO Start Strategies for 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_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-18466-6_30
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)