Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Electronic Science and Technology》 2014-10
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.
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
Chinese Journal Full-text Database 6 Hits
1 JIN Hui-min,MA Liang (College of Management,University of Shanghai for Science and Technology,Shanghai 200093,China);Genetic annealing evolutionary algorithm applied to the knapsack problem[J];Journal of University of Shanghai For Science and Technology;2004-06
2 ZHAO Xinchao,HAN Yu,AI Wenbao School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China;Improved genetic algorithm for knapsack problem[J];Computer Engineering and Applications;2011-24
3 QIAN Shu-qu1,WU Hui-hong1,TU Xin2(1.Department of Mathematic and Computer Science,Anshun College,Anshun 561000,China;2.School of Automation,Southeast University,Nanjing 211189,China);Dynamic Immune Optimization Algorithm and Its Application in Knapsack Problem[J];Computer Engineering;2011-20
4 LIU Man-dan(College of Information Science and Technology,East China University of Science and Technology,Shanghai 200237,China);A Memetic Algorithm for the Multidimensional Knapsack Problems[J];Computing Technology and Automation;2007-04
5 HE Yi-chao~1 LIU Kun-qi~(1,2) ZHANG Cui-jun~1 ZHANG Wei~1 1.Department of Information Project,Shijiazhuang University of Economics,Shijiazhuang 050031,China; 2.School of Computer,China University of Geosciences,Wuhan 430074,China;Greedy genetic algorithm for solving knapsack problems and its applications[J];Computer Engineering and Design;2007-11
6 ZHANG Zong-fei(Department of Computer Engineering,Taizhou Vocational and Technical College,Taizhou 318000,China);Novel improved quantum evolutionary algorithm for combinatorial optimization problems[J];Computer Engineering and Design;2010-17
Chinese Journal Full-text Database 10 Hits
1 CHEN Hailei,XUAN Guangzhe,YU Hai,ZHONG Shi(College of Computer Science and Technology,Jilin University,Changchun 130012);Asynchronous Pattern of Particle Swarm Optimization Algorithm Based on Converging Factor Model for Solving 0-1 Knapsack Problem[J];;2006-02
2 CHEN Liang(Taishan Vocational Technology College,Tai'an 271000,China);On hybrid algorithm for knapsack problem based on shuffled leapfrog algorithm[J];Journal of Henan University of Urban Construction;2011-03
3 YE Yong-chun~1,CHE Lin-xian~(2,3),HE Bing~(2,3)(1.Department of Electronic & Information Engineering,Luzhou Vocational & Technical College,Luzhou 646005,China;2.Department of Mechatronic Engineering,Luzhou Vocational & Technical College,Luzhou 646005,China;3. Institute of Mechatronic Engineering,Luzhou Vocational & Technical College,Luzhou 646005,China);A Kind of Hybrid Particle Swarm Optimization Algorithm for Solving 0-1 Knapsack Problems[J];Journal of Changsha University of Electric Power(Natural Science);2006-04
4 LIANG De-sai(Dept of Mathematics and Computer Science of Qinzhou University,Qinzhou 535000,China);On the Algorithmin of Solving the Knapsack Problem Based on an Adaptive Genetic Algorithm[J];Computer Knowledge and Technology;2012-14
5 SHUAI Xun-bo1a,ZHOU Xiang-guang1a,LI Shu-tie1b,CHEN Dong2,TIAN Hong-peng1a (1.Langfang Branch of Research Institute of China Petroleum Exploration and Development,a.Institute of Geophysics and Information;b.Institute of Porous and Fluid Mechanics,Langfang Hebei 065007,China;2.Department of Human Resource,Research Institute of China Petroleum Exploration and Development,Beijing 100083,China);An Improved Genetic Algorithm Based on Binary Coding for 0_1 Knapsack Problem[J];Journal of Dezhou University;2010-02
6 Gao Shang~1,2,Yang Jingyu~3(1.School of Electronics and Information,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu 212003,China;2.Provincial Key Laboratory of Computer Information Processing Technology,Suzhou,Jiangsu 215006,China;3.Department of Computer Science and Technology,Nanjing University of Science and Technology,Nanjing 210094,China);Solving Knapsack Problem by Hybrid Particle Swarm Optimization Algorithm[J];Engineering Science;2006-11
7 LIANG Guo -hong,ZHANG Sheng,HUANG Hui,HE Shang -lu (College of Mathematics, Physics & Software Engineering, Lanzhou Jiaotong University, Gansu 730070,China);A Kind of Renewed Simulated Annealing Algorithm Solves 0-1 Knapsack Problem[J];Journal of Guangxi University for Nationalities(Natural Science Edition);2007-03
8 BAI Dong-ling1,GUO Shao-yong2(1.Computer Center,Xinxiang Medical University,Xinxiang 453003,China;2.Center of Modern Education Technology,Xinxiang Medical University,Xinxiang 453003,China);An improved hybrid genetic algorithm for 0_1 knapsack problem[J];Electronic Design Engineering;2013-14
9 ZHAO Xin-chao;WU Zhao-jun;School of Science,Beijing University of Posts and Telecommunications;;Multiple Bits Greedy Mutation-based Genetic Algorithm for Knapsack Problem[J];Journal of Guangxi Normal University(Natural Science Edition);2013-04
10 KONG Ling-yi;School of Management Engineering,Xi'an University of Post and Telecommunications;;Applied research on genetic algorithm based on simulated annealing of constrained traveling salesman problem[J];Journal of Northeast Normal University(Natural Science Edition);2014-01
China Proceedings of conference Full-text Database 1 Hits
1 GAO Shang (School of Computer Science and Engineering,Jiangsu University of Science and Technology,Zhenjiang 212003,China);Solving knapsack problem by estimation of distribution algorithm[A];[C];2013
【Secondary Citations】
Chinese Journal Full-text Database 10 Hits
1 JIA Xuan-yao~1,WANG Fang~2(1.College of Information,Ningbo Institute of Technology,Zhejiang University,Ningbo 315100,P.R.China;2.School of Business Management,University of East Anglia,Norwich,NR4 7TJ,England);Improved niching genetic algorithm[J];Journal of Chongqing University of Posts and Telecommunications;2005-06
2 ZHANG Yong-bing,WANG Bin,ZHANG Yong-fei,YANG Xiao-hong,CHEN Hai-peng(Department of Information,Affiliated Hospital of Dali University,Dali,Yunnan 671000,China);Knapsack's Solution Based on Genetic Algorithms[J];Journal of Dali College;2005-05
3 XING Huan-lai1,2,PAN Wei1,ZOU Xi-hua1(1.School of Information Science and Technology,Southwest Jiaotong University,Chengdu,Sichuan 610031,China;2.School of Telecommunication Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China);A Novel Improved Quantum Genetic Algorithm for Combinatorial Optimization Problems[J];Acta Electronica Sinica;2007-10
4 SONG Hai-sheng1,2,3, SONG Hai-zhou4, FU Ren-yi1, XU Rui-song2(1.Dept.of Computer Technology, Shunde Polytechnic, Foshan 528300;2.Guangzhou Institute of Geochemistry, Chinese Academy of Sciences, Guangzhou 510640;3.Graduate University of Chinese Academy of Sciences, Beijing 100049;4.School of Mathematical Sciences, Huaqiao University, Quanzhou 362021);Hybrid Genetic Algorithm for Multiconstraint 0-1 Knapsack Problem[J];Computer Engineering;2009-13
5 ZHANG Ling 1),2) ZHANG Bo 2),3) 1)(Key Laboratory of Intelligent Computing & Signal Processing, Institute of Artificial Intelligence, Anhui University, Hefei 230039) 2)(Department of Computer Science and Technology, Tsinghua University, B;Good Point Set Based Genetic Algorithm[J];Chinese Journal of Computers;2001-09
6 ZHUANG Zhong-wen,QIAN Shu-qu (Dept.of Mathematics & Computer Science,Anshun College,Anshun Guizhou 561000,China);Immune algorithm with antibody-repaired and its application for high-dimensional 0/1 knapsack problem[J];Application Research of Computers;2009-08
7 JIANG Teng-xu,XIE Feng(Dept.of Computer,Jiujiang Professional University,Jiujiang 332000,China);Several Measures to Prevent Premature Convergence of Genetic Algorithm[J];Computer and Modernization;2006-12
8 GAO Hui, XU Guang-hui, WANG Zhe-ren (School of Communication Science and Engineering, Harbin Institute of Technology, Harbin Heilongjiang 150090, China);An improved quantum evolutionary algorithm and its application to a real distribution routing problem[J];Control Theory & Applications;2007-06
9 WANG Ling1,2(1.TNList,Beijing 100084,China;2.Department of Automation,Tsinghua University,Beijing 100084,China.);Advances in quantum-inspired evolutionary algorithms[J];Control and Decision;2008-12
10 ZHANG Zhu-Hong QIAN Shu-Qu (Department of Mathematics,College of Science,Guizhou University,Guiyang 550025);Adaptive Immune Algorithm and Its Track to Dynamic Function Optimization[J];Pattern Recognition and Artificial Intelligence;2007-01
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved