Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

A Heuristic Network Strategy Model and Algorithm to the 0-1 Knapsack Problem

XIA Qian;ZHANG Xiaolong;School of Traffic and Transportation,Lanzhou Jiaotong University;  
In order to overcome GA's disadvantages that it can be easily trapped into local optimization and has low accuracy of search,a network strategy heuristic genetic optimization algorithm has been proposed,and the algorithm has been successfully applied to solving the 0-1 knapsack problem. In this algorithm,the strategy of network node correlation is introduced to improve the global optimizing capability. This paper also introduces network node matrix optimization and uses its thorough local traversal search to improve the solution accuracy. The simulation results show that NSHGA can not only avoid premature effectively,but also has powerful optimizing ability and high optimizing precision. Compared with basic genetic algorithm simulation,NSHGA can obviously improve the accuracy of the solution to the 0-1 knapsack problem.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved