ACO Algorithm for MKP Using Various Heuristic Information

  • Stefka Fidanova
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2542)


The ant colony optimization (ACO) algorithms are being applied successfully to diverse heavily constrained problems: traveling salesman problem, quadratic assignment problem. Early applications of ACO algorithms have been mainly concerned with solving ordering problems. In this paper, the principles of the ACO algorithm are applied to the multiple knapsack problem (MKP). In the first part of the paper we explain the basic principles of ACO algorithm. In the second part of the paper we propose different types of heuristic information and we compare the obtained results.


Travel Salesman Problem Solution Component Quadratic Assignment Problem Pheromone Trail Heuristic Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chu, P.C., Beasley, J.E.: A genetic algorithm for the multiple knapsack problem. Journal of Heuristics, 4 (1998) 63–86.zbMATHCrossRefGoogle Scholar
  2. 2.
    Dorigo, M., Di Caro, G.: The ant colony optimization metaheuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.): New Idea in Optimization, McGrow-Hill (1999) 11–32.Google Scholar
  3. 3.
    Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1 (1999) 53–66.CrossRefGoogle Scholar
  4. 4.
    Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for distributed discret optimization. Artificial Life, 5 (1999) 137–172.CrossRefGoogle Scholar
  5. 5.
    Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transaction on Systems, Man. and Cibernetics-Part B, 26 (1996) 29–41CrossRefGoogle Scholar
  6. 6.
    Fogel, B.: Evolutionary computation: Toward a new philosophy of machine intelligence. IEEE Press, New York (1994)Google Scholar
  7. 7.
    Gambardella, M.L., Taillard, E.D., Agazzi, G.: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.): New Ideas in Optimization, McGraw-Hill (1999) 63–76.Google Scholar
  8. 8.
    Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the QAP. J. of Oper. Res. Soc. 50 (1999) 167–176.zbMATHGoogle Scholar
  9. 9.
    Glover, F.: Tabu search. ORSA J. of Comput. 1 (1989)Google Scholar
  10. 10.
    Kirkpatrick, S., Gelatt, C.D., Vechi, M.P.: Optimization by simulated annealing. Scienece, 220 (1983) 671–680.CrossRefGoogle Scholar
  11. 11.
    Kochenberger, G., McCarl, G., Wymann, F.: A heuristic for general integer programming. Decision Sciences, 5 (1974) 36–44.CrossRefGoogle Scholar
  12. 12.
    Leguizamon, G., Michalevich, Z.: A new version of the ant system for subset problems. In: Proceedings of Int. Conf. on Evolutionary Computations, Washington (1999)Google Scholar
  13. 13.
    Michel, R., Middendorf, M.: An island based ant system with lookahead for the shortest common super-sequence problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H-P. (eds.): Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Vol. 1498 (1998) 692–708.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Stefka Fidanova
    • 1
  1. 1.IRIDIAUniversité Libre de BruxellesBruxellesBelgium

Personalised recommendations