Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Engineering Science》 2006-11
Add to Favorite Get Latest Update

Solving Knapsack Problem by Hybrid Particle Swarm Optimization Algorithm

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)  
The classical particle swarm optimization is a powerful method to find the minimum of a numerical function,on a continuous definition domain.The particle swarm optimization algorithm combining with the idea of the genetic algorithm is recommended to solve knapsack problem.All the 6 hybrid particle swarm optimization algorithms are proved effective.Especially the hybrid particle swarm optimization algorithm derived from across strategy A and mutation strategy C is a simple yet effective algorithm and it has been applied successfully to investment problem.It can easily be modified for any combinatorial problem for which there has been no good specialized algorithm.
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Citations】
Chinese Journal Full-text Database 5 Hits
1 Yang Wei, Li Qiqiang (School of Control Science and Engineering, Shandong University, Jinan 250061, China);Survey on Particle Swarm Optimization Algorithm[J];Engineering Science;2004-05
2 Li Aiguo 1,2 Qin Zheng 1 Bao Fumin 1 He Shengping 11 (Department of Computer Science,Xi'an Jiaotong University,Xi'an710049) 2 (Department of Computer Science,Xi'an University of Science and Technology,Xi'an710054);Particle Swarm Optimization Algorithms[J];Computer Engineering and Applications;2002-21
3 YU Yongxin,ZHANG Xinrong (Computer Department of Tianjin University , Tianjin 300072);Optimization Algorithm for Multiple-choice Knapsack Problem Based on Ant Colony System[J];Computer Engineering;2003-20
4 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
5 MA Liang, WANG Long-de (College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China);ANT OPTIMIZATION ALGORITHM FOR KNAPSACK PROBLEM[J];Computer Applications;2001-08
【Co-references】
Chinese Journal Full-text Database 10 Hits
1 GAO Bo(School of Electronic Information and Technology,Southwest University,Chongqing 400715,China);Research on the Prospect of Particle Swarm Optimization Algorithm[J];Journal of Chongqing Institute of Technology;2006-11
2 SUN Hai-jin, ZHU Na, ZHOU Nai-fu (School of Computer Science and Telecommunications Engineering, Jiangsu University, Zhenjiang 212013, China);Distributed routing and wavelength assignment based on ant colony system[J];Study On Communications;2005-02
3 Lü Xin Feng Dengguo(State Key Laboratory of Information Security, Graduate School, Chinese Academic of Science, Bejing 100039, China);Quantum algorithm analysis of knapsack problem[J];Journal of Beijing University of Aeronautics and Astronautics;2004-11
4 ZHANG Xiao-qin,HUANG Yu-qing (Dept. of Info & Contr, SWUST Sichuan Mianyang 621010);Heuristics Algorithm for Knapsack Problem Based on the Tabu Search[J];Journal of University of Electronic Science and Technology of China;2005-03
5 Wu Hailiang~(1,2) Pei Xiandeng~1 L M Liu~2(1 College of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan,430074,China;2 Industrial Engineering and Management Department,The Hong KongUniversity of Science and Technology,Hong Kong,China);An optimal algorithm of data packets scheduling for wireless communication systems by using Knapsack theory[J];Journal of Huazhong University of Science and Technology(Nature Science Edition);2006-11
6 SHI Kai,CAI Yan-guang,ZOU Gu-shan,WANG Tao(Faculty of Automation,Guangdong University of Technology,Guangzhou 510090,China);Research of Ant Colony Algorithm on Vehicle Routing Problems[J];Computing Technology and Automation;2005-03
7 LU Zhao-quan,SHEN Jun-feng(School of Electric Engineering and Automation,Hefei University of Technology,Hefei 230009,China);Tire pressure monitoring systems for automobiles[J];Journal of Hefei University of Technology(Natural Science);2007-03
8 CHEN Bao-wen, SONG Shen-min, CHEN Xing-lin(School of Astronautics, Harbin Institute of Technology, Harbin Heilongjiang 150001, China);Vehicle routing problem with fuzzy demands and its heuristic ant colony algorithm[J];Journal of Computer Applications;2006-11
9 HONG Hua-xiu,ZHAN Chuan-jie,HONG Sheng-hua(Nanchang University Network Center,Nanchang 330029,China);Application of Immune Algorithm to Knapsack Problem[J];Computer and Modernization;2006-09
10 Zhang Zhiming1,2 Deng Jiangang2 Yu Min2 1(College of Software,Jiangxi Normal University,Nanchang 330027) 2(College of Computer Information Technology,Jiangxi Normal University,Nanchang 330027);An Efficient Multi-Round Electronic Auction Based on Knapsack Theory[J];Computer Engineering and Applications;2006-04
【Secondary Citations】
Chinese Journal Full-text Database 7 Hits
1 Wang Tao, Li Qiqiang (School of Control Science and Engineering, Shandong University, Jinan 250061, China)[;A Parallel Evolutionary Algorithm Based on Space Contraction[J];Engineering Science;2003-03
2 Li Aiguo 1,2 Qin Zheng 1 Bao Fumin 1 He Shengping 11 (Department of Computer Science,Xi'an Jiaotong University,Xi'an710049) 2 (Department of Computer Science,Xi'an University of Science and Technology,Xi'an710054);Particle Swarm Optimization Algorithms[J];Computer Engineering and Applications;2002-21
3 Xu Hai; Liu Shi; Ma Yong; Lan Hongxiang (Industry Control Lab,Electronic Engineering Department,Fudan University, Shanghai,PRC 200433);The Adaptive Algorithm of Fuzzy Logic System Basd on Modified Particle Swarm Optimiztion[J];COMPUTER ENGINEERING AND APPLICATIONS;2000-07
4 WU Bin SHI Zhong-Zhi(Key Laboratory of Intelligence Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080);An Ant Colony Algorithm Based Partition Algorithm for TSP[J];Chinese Journal of Computers;2001-12
5 Wu Zhiyuan Shao Huihe(Department of Automation, Shanghai Jiaotong University)Wu Xinyu(Nanjing Institute of Posts and Telecommunications));Genetic Annealing Evolutionary Algorithm[J];JOURNAL OF SHANGHAI JIAOTONG UNIVERSITY;1997-12
6 Ma Liang (School of Management, Shanghai University of Science and Technology, Shanghai 200093) Jiang Fu (School of Management, Shanghai Jiaotong University, Shanghai 200052);ANT ALGORITHM FOR THE DEGREE CONSTRAINED MINIMUM SPANNING TREE[J];JOURNAL OF SYSTEMS ENGINEERING;1999-03
7 Ma LiangAssociate Professor, College of Systems Science and Systems Engineering, University of Shanghai for Science and Technology, Shanghai 200093;Ant Algorithm-Optimization strategy from the insect colony[J];Nature Magazine;1999-03
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved