Abstract
Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., traveling salesman problem). We introduce a new version of Ant System-an ACO algorithm for solving subset problems. The computational study involves the Multiple Knapsack Problem (MKP); the reported results show the potential power of the ACO approach for solving this type of subset problem.
Keywords
Knapsack problemTravelling salesman problemAnt colony optimization algorithmsComputer scienceMathematical optimizationAnt colonyOptimization problemExtremal optimizationMetaheuristicANTMathematicsMeta-optimization
Affiliated Institutions
Related Publications
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple cons...
MAX-MIN Ant System and local search for the traveling salesman problem
Ant System is a general purpose algorithm inspired by the study of the behavior of ant colonies. It is based on a cooperative search paradigm that is applicable to the solution ...
Solving symmetric and asymmetric TSPs by ant colonies
We present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to b...
Applying the genetic approach to simulated annealing in solving some NP-hard problems
A stochastic approach called the annealing-genetic algorithm is presented for solving some well-known combinatorial optimization problems. This approach incorporates genetic alg...
Ant colony system: a cooperative learning approach to the traveling salesman problem
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents calle...
Publication Info
- Year
- 2003
- Type
- article
- Pages
- 1459-1464
- Citations
- 214
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
214
OpenAlex
Cite This
Guillermo Leguizamón,
Zbigniew Michalewicz
(2003).
A new version of ant system for subset problems.
, 1459-1464.
https://doi.org/10.1109/cec.1999.782655
Identifiers
- DOI
- 10.1109/cec.1999.782655