Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Changchun University of Science and Technology(Natural Science Edition)》 2006-02
Add to Favorite Get Latest Update

Asynchronous Pattern of Particle Swarm Optimization Algorithm Based on Converging Factor Model for Solving 0-1 Knapsack Problem

CHEN Hailei,XUAN Guangzhe,YU Hai,ZHONG Shi(College of Computer Science and Technology,Jilin University,Changchun 130012)  
An asynchronous pattern of Particle Swarm Optimization algorithm based on Converging Factor Model is presented in this article.The proposed algorithm is programmed with java multiple threads and is examined in solving 0-1 knapsack problem.0-1 knapsack problem is a max-value searching problem during which the weights and values are given and the total weights must be not over the weight that is given before.The experiments show that it is effective for solving 0-1 knapsack problem.
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved