Abstract
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard combinatorial optimization problems (COPs). In this paper we investigate the influence of model bias in model-based search as ACO. We present the effect of two different pheromone models for ACO algorithm to tackle the Multiple Knapsack Problem (MKP). The MKP is a subset problem and can be seen as a general model for any kind of binary problems with positive coefficients. The results show the importance of the pheromone model to quality of the solutions.
This is a preview of subscription content, log in via an institution to check access.
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
Dorigo, M., Di Caro, G.: The Ant Colony Optimization metaheuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Idea in Optimization, pp. 11–32. McGraw-Hill, New York (1999)
Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant Algorithms for Distributed Discrete Optimization. J. of Artificial Life 5, 137–172 (1999)
Ferreira, C.E., Martin, A., Weismantel, R.: Solving Multiple Knapsack Problems by Cutting Planes. SIAM Journal on Optimization 6(3), 858–877 (1996)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transaction on Evolutionary Computation 1, 53–66 (1999)
Gambardella, M.L., Taillard, E.D., Dorigo, M.: Ant Colonies for the QAP. J. of Oper. Res. Soc. 50, 167–176 (1999)
Kochenberger, G., McCarl, G., Wymann, F.: A Heuristic for General Integer Programming. J. of Decision Sciences 5, 34–44 (1974)
Leguizamon, G., Michalevich, Z.: A New Version of Ant System for Subset Problems. In: Proceedings of Int. Conf. on Evolutionary Computations, Washington (1999)
Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line Knapsack Problems. J. of Mathematical Programming 68(1), 73–104 (1995)
Osman, I.H., Kelley, J.P.: Metaheuristic: An Overview. In: Osman, I.H., Kelley, J.P. (eds.) Metaheuristic: Theory and Applications. Kluwer Academic Publishers, Dordrecht (1996)
Schaffer, A.A., Yannakakis, M.: Simple Local Search Problems that are Hard to Solve. Society for Industrial Applied Mathematics Journal on Computing 20, 56–87 (1991)
Wolpert, D., Macready, W.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation, 67–82 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fidanova, S. (2005). Ant Colony Optimization for Multiple Knapsack Problem and Model Bias. In: Li, Z., Vulkov, L., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2004. Lecture Notes in Computer Science, vol 3401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31852-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-31852-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24937-5
Online ISBN: 978-3-540-31852-1
eBook Packages: Computer ScienceComputer Science (R0)