The influence of trail representation in ACO for good results in MKP

Authors:
Urszula Boryczka
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Year:
2006

Citing 6
Cited 0

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
A Study of Some Properties of Ant-Q

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem

HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Ant Colony Optimization

Ant Colony Optimization
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new optimization algorithm based on ant colony metaphor and a new approach for the Multiple Knapsack Problem is presented. The MKP is the problem of assigning a subset of n items to m distinct knapsacks, such that the total profit sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several difficulties in adaptation as well as the trail representation of the solutions of MKP or a dynamically changed heuristic function applied in this approach. Presented results show the power of the ACO approach for solving this type of subset problems.