Abstract
This paper describes Monte Carlo (MC) method for Multiple Knapsack Problem (MKP). The MKP can be defined as economical problem like resource allocation and capital budgeting problems. The Ant Colony Optimization (ACO) is a MC method, created to solve Combinatorial Optimization Problems (COPs). The paper proposes a Local Search (LC) procedure which can be coupled with the ACO algorithm to improve the efficiency of the solving of the MKP. This will provide optimal or near optimal solutions for large problems with an acceptable amount of computational effort. Computational results have been presented to assess the performance of the proposed technique.
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. McGrow-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)
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)
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)
Rubinstein, R.Y.: Simulation and the Monte Carlo Method. John Wiley & Sons, Chichester (1981)
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)
Strelsov, S., Vakili, P.: Variance Reduction Algorithms for Parallel Replicated Simulation of Uniformized Markov chains. J. of Discrete Event Dynamic Systems: Theory and Applications 6, 159–180 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fidanova, S. (2004). Monte Carlo Method for Multiple Knapsack Problem. In: Lirkov, I., Margenov, S., Waśniewski, J., Yalamov, P. (eds) Large-Scale Scientific Computing. LSSC 2003. Lecture Notes in Computer Science, vol 2907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24588-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24588-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21090-0
Online ISBN: 978-3-540-24588-9
eBook Packages: Springer Book Archive