A New Approach for Solving 0/1 Knapsack Problem

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Oct 2006Publisher:IEEEJournal:2006 IEEE International Conference on Systems, Man and Cybernetics

Authors: Chou-Yuan Lee; Zne-Jung Lee; Shun-Feng Su;

doi: 10.1109/icsmc.2006.384598

A New Approach for Solving 0/1 Knapsack Problem

- Summary
- Metrics

Abstract

In this paper, we reported our study on solving 0/1 knapsack problem effectively by using ant colony optimization. The 0/1 knapsack problem is to maximize the total profit under the constraint that the total weight of all chosen objects is at the most weight limit. In our study, we viewed the search in ant colonies as a mechanism providing a better performance and it has the ability to escape from local optima. In this paper, several examples are tested to demonstrate the superiority of the proposed algorithm. From simulation results, the proposed algorithm indeed has remarkable performance.

Related Organizations

Huafan University
Taiwan
Lan Yang Institute of Technology
Taiwan
National Taiwan University of Science and Technology
Taiwan

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	15
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average