By Topic

A Distributed Algorithm for 0-1 Knapsack Problem Based on Mobile Agent

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shanping Qiao ; Sch. of Inf. Sci. & Eng., Univ. of Jinan, Jinan ; Shixian Wang ; Yongzheng Lin ; Ling Zhao

The knapsack problem is a typical one of NPC problems, which is easy to be described but difficult to be solved. It is very important in theory and practice to study it. Nowadays there is a variety of research in algorithm for solving it. As the parallel processing technologies develop, the research of effective parallel algorithms for this problem attracts much attention. To run those algorithms needs high level hardware and high performance parallel computers. Using mobile agent technologies, a more effective model to solve the complex distributed problems can be established. Combines mobile agent with the traditional parallel algorithm, the process in a parallel computer can be evolved into the one performed by some ordinary computers. This can avoid the limitation of experiment conditions and provides convenience in practice. In this paper, a distributed algorithm is proposed for the 0-1 knapsack problem based on the mobile agent, and it is feasible and effective in theoretical analysis.

Published in:

Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on  (Volume:2 )

Date of Conference:

26-28 Nov. 2008