Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators

Abstract:

Article Preview

0-1 knapsack problem is a typical combinatorial optimization question in the design and analysis of algorithms. The mathematical description of the knapsack problem is given in theory. The 0-1 knapsack problem is solved by ant colony optimistic algorithm that is improved by introducing genetic operators. To solve the 0-1 knapsack problem with the improved ant colony algorithm, experimental results of numerical simulations, compared with greedy algorithm and dynamic programming algorithm, have shown obvious advantages in efficiency and accuracy on the knapsack problem.

Info:

Periodical:

Advanced Materials Research (Volumes 230-232)

Edited by:

Ran Chen and Wenli Yao

Pages:

973-977

DOI:

10.4028/www.scientific.net/AMR.230-232.973

Citation:

Z. J. Hu and R. Li, "Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators", Advanced Materials Research, Vols. 230-232, pp. 973-977, 2011

Online since:

May 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.