Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Guangxi University for Nationalities(Natural Science Edition)》 2007-03
Add to Favorite Get Latest Update

A Kind of Renewed Simulated Annealing Algorithm Solves 0-1 Knapsack Problem

LIANG Guo -hong,ZHANG Sheng,HUANG Hui,HE Shang -lu (College of Mathematics, Physics & Software Engineering, Lanzhou Jiaotong University, Gansu 730070,China)  
From the viewpoint of intensifying convergence and reducing dependency of parameters,a renewed simulated annealing algorithm for solving knapsack problem is proposed.The algorithm avoids the disadvantages of traditional simulated annealing algorithm.It has superiority in performance,efficiency and reliability.The detailed realization of the algorithm for solving 0-1 knapsack problem is illustrated.
【Fund】: 国家自然科学基金资助项目:40301037
【CateGory Index】: O224
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 2 Hits
1 ZHU Li-hua;Mathematics and Physics Department,Fujian University of Technology;;A continuous approach to 0-1 program and its solution with penalty function algorithm[J];Journal of Fuyang Teachers College(Natural Science);2015-01
2 XU Hao-man,TANG Lun,CHEN Qian-bin (School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China);An Investigation of Dynamic Spectrum Allocation Algorithm Based on Game Learning[J];Computer Simulation;2010-05
【Citations】
Chinese Journal Full-text Database 4 Hits
1 LIU Huai-liang (School of Information & Mechanical Electronics Engineering,Guangzhou University,Guangzhou 510006,China);Simulated annealing algorithm and its improvement[J];Journal of Guangzhou University(Natural Science Edition);2005-06
2 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
3 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
4 LIN Xin (Dept.of Computer Science,Tongji University,Shanghai 200433,China);Discussion on the Zero-One Knapsack Problem[J];Microcomputer Development;2005-10
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 XU Liang-feng ( School of Computer Science & Information Engineering,Hefei University of Technology,Hefei 230009);Fixed Frequency Assignment Based on Genetic Annealing Algorithm in Cellular Mobile Communication[J];Journal of Anhui Agricultural University;2004-04
2 DAI Yuan-yong CHEN Su-qiong SHEN Rong-fa 2.HE Yi-zhu YU Liang (1.Shanghai Baosteel Group Meishan Iron and Steel Corp,Nanjing China,210039; 2.Anhui University of Technology,Maanshan China,243002);Optimization of C-Mn Steel Industrial Process Using Multigroup Genetic Algorithm Based on Simulated Annealing[J];Bao Steel Technology;2003-01
3 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
4 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
5 XU Zhao-mei1;TIAN Qi-wen2(1.Huaiyin Institute of Technology,Huaian 223001;2.Southeast University,Nanjing 210096);The Genetic Algorithm Applying in the Utilization of Remnant Fabrication[J];Group Technology & Production Modernization;2007-03
6 XU Zhao-mei(Department of Mechanical Engineering,Huaiyin Instituteof Technology,Huai'an 223003,China);A Method for 0/1 Knapsack Problem Which Value Equal with Weight[J];Group Technology & Production Modernization;2009-03
7 HUANG Xian-jiang,JIANG Chang-sheng(College of Automation Engineering,Nanjing University of Aeronautics & Astronautics,Nanjing 210016,China);A self-adaptive region fuzzy logic guidance law based on Genetic Algorithm and Simulated Annealing[J];Electronics Optics & Control;2006-05
8 Chen Zhangchao, Gu Jie, Sun Chunjun (Shanghai Jiaotong University, 200030, Shanghai, China);APPLICATION OF THE MIXED GENETIC-SIMULATED ANNEALING ALGORITHMIN ELECTRIC NETWORK PLANNING[J];AUTOMATION OF ELECTRIC POWER SYSTEMS;1999-10
9 QU Zhong-wei, GUAN Wei-juan, XU Feng, CHEN Qing-hua (Dept. of Mathematics and Physics, Anhui University of Science and Technology, Huainan 232001, China);Research on Algorithm of Multiple-choice Knapsack Problem[J];Computer Knowledge and Technology(Academic Exchange);2007-02
10 LI Chang1,2,WANG Chao3,SHI Xiang-yong3,WANG Lei1 (1.Institute of Electronics and Information Engineering,Tongji University,Shanghai 200092,China;2.Shanghai Petrochemical Academy,Shanghai 201512,China;3.Institute of Communication and Information Engineering,Tongji University,Shanghai 200092,China);Summary of Knapsack Problems Based on Particle Swarm Optimization[J];Computer Knowledge and Technology(Academic Exchange);2007-19
China Proceedings of conference Full-text Database 2 Hits
1 Zhao Yanling Liu Chun Cao Yuan Gao Cuiyun Chen Shengjun(Hefei University of Technology, heFei 230009, China)(Anhui TV University, Hefei 23002g,China);Study on Finding Minimal Test Set of Circuits Based on GASA[A];[C];2004
2 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
【Co-references】
Chinese Journal Full-text Database 6 Hits
1 LI Yan-yan1,LI Xing-si*2(1.Department of Applied Mathematics,Dalian University of Technology,Dalian 116024,China;2.State Key Laboratory of Structural Analysis for Industrial Equipment,Dalian University of Technology, Dalian 116024,China);A continuous solution to linear 0-1 programming[J];Journal of Dalian University of Technology;2009-02
2 Li Xiaomeng et al;An Introduction to Mixed Genetic Algorithm for Solving Multi-dimension Package Problem[J];Computer Development & Applications;2006-01
3 CAI Xiaoyu1,*"CHEN Zhong1,*"GU Feng1,*"ZHANG Weiguo2(1.Aetna College of Management, Shanghai Jiaotong University, Shanghai 200052, China;2.College of Science, Xi'an Jiaotong University, Xi'an 710049, China);Analysis of Nash equilibrium for Gournot model with incomplete information[J];Journal of Ningxia University(Natural Science Edition);2002-02
4 Gao Feng Zhang Liansheng (School of Sciences, Shanghai University);Two Continuing Ways for Polynomial 0-1 Integer Programming[J];JOURNAL OF SHANGHAI UNIVERSITY(NATURAL SCIENCE EDITION);1999-02
5 SUI Yun-kang,JIA Zhi-chao (The College of Mechanical Engineering & Applied Electronics Technology:Beijing University of Technology Beijing 100022,China);A Continuous Approach to 0-1 Linear Problem and Its Solution with Genetic Algorithm[J];Mathematics in Practice and Theory;2010-06
6 ZHANG Yu-bo, LUO Xian-jue, XUE Jun-yi(School of Electrical Engineering, Xi'an Jiaotong University,Xi'an 710049, China);Dynamic Cournot Model and Stability Analysis in Oligopoly Market[J];Systems Engineering-theory & Practice;2003-11
【Secondary References】
Chinese Journal Full-text Database 1 Hits
1 ZHANG Bei-wei1,2,HU Kun-yuan1,ZHU Yun-long1(1.Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang Liaoning 110016,China; 2.Graduate University of Chinese Academy of Sciences,Beijing 100049,China);Parameters adjustment in cognition radio spectrum allocation based on game theory[J];Journal of Computer Applications;2012-09
【Secondary Citations】
Chinese Journal Full-text Database 3 Hits
1 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
2 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
3 CHEN Hua-gen,WU Jian-sheng,WANG Jia-lin,CHEN Bing(Key Laboratory of Marine Geology,Tongji University,Shanghai 200092,China);Mechanism Study of Simulated Annealing Algorithm[J];Journal of Tongji University;2004-06
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved