A chaotic annealing neural network with gain sharpening and its application to the 0/1 knapsack problem

被引：4
|
作者：
Wang, B
Dong, H
He, ZY
机构：
[1] Nanjing Univ Posts & Telecommun, Dept Informat Engn, Nanjing 210003, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Dept Commun Engn, Nanjing 210003, Peoples R China
[3] Southeast Univ, Dept Radio Engn, Nanjing 210096, Peoples R China
来源：
NEURAL PROCESSING LETTERS | 1999年 / 9卷 / 03期
关键词：
knapsack problem; chaotic annealing; neural network;
D O I：
10.1023/A:1018603904290
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this article we present a modified transiently chaotic neural network model and then use it to solve the 0/1 knapsack problem. During the chaotic searching the gain of the neurons is gradually sharpened, this strategy can accelerate the convergence of the network to a binary state and keep the satisfaction of the constraints. The simulation demonstrates that the approach is efficient both in approximating the global solution and the number of iterations.
引用
收藏
页码：243 / 247
页数：5
相关论文
共 50 条
  • [21] Chaotic Simulated Annealing by a Neural Network with a Variable Delay: Design and Application
    Chen, Shyan-Shiou
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2011, 22 (10): : 1557 - 1565
  • [22] A Master-Slave Model NGA and its Application in the Multidimensional 0-1 knapsack problem
    Man, Zibin
    Zhao, Tinghong
    ADVANCES IN MECHATRONICS AND CONTROL ENGINEERING II, PTS 1-3, 2013, 433-435 : 566 - +
  • [23] Annealed chaotic neural network with nonlinear self-feedback and its application to clustering problem
    Lin, JS
    PATTERN RECOGNITION, 2001, 34 (05) : 1093 - 1104
  • [24] TRANSIENTLY CHAOTIC NEURAL NETWORK BASED ON SWITCHED COOLING AND ITS APPLICATION TO MAXIMUM CLIQUE PROBLEM
    Yi, Junyan
    Yang, Gang
    Gao, Shangce
    Tang, Zheng
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2009, 5 (06): : 1569 - 1586
  • [25] An efficient population-based simulated annealing algorithm for 0-1 knapsack problem
    Moradi, Nima
    Kayvanfar, Vahid
    Rafiee, Majid
    ENGINEERING WITH COMPUTERS, 2022, 38 (03) : 2771 - 2790
  • [26] An experimental evaluation of a parallel simulated annealing approach for the 0-1 multidimensional knapsack problem
    Dantas, Bianca de Almeida
    Caceres, Edson Norberto
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 120 : 211 - 221
  • [27] A Parallelization of a Simulated Annealing Approach for 0-1 Multidimensional Knapsack Problem Using GPGPU
    Dantas, Bianca de Almeida
    Caceres, Edson Norberto
    PROCEEDINGS OF 28TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, (SBAC-PAD 2016), 2016, : 134 - 140
  • [28] Application of the Lattice of the Power Set to Solve the 0/1knapsack Problem
    Zavala-Diaz, J. C.
    Mexicano-Santoyo, A.
    Castillo, H.
    de la Rosa-Flores
    Hernandez-Aguilar, J. A.
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014), 2015, 1648
  • [29] APPROXIMATE ALGORITHMS FOR 0/1 KNAPSACK PROBLEM
    SAHNI, S
    JOURNAL OF THE ACM, 1975, 22 (01) : 115 - 124
  • [30] ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    LAURIERE, M
    MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 1 - 10
12345