Affiliations: [a] Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
| [b] Department of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
Correspondence:
[*]
Corresponding author. Hedieh Sajedi, Department of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, P.O. BOX: 14155-6455, Tehran, Iran.Tel.: +98 21 61112915; hhsajedi@ut.ac.ir
Abstract: The Gravitational Search Algorithm (GSA) has been proposed for solving continues problems based on the law of gravity. In this paper, we propose a Cognitive Discrete GSA (called CDGSA) for solving 0-1 knapsack problem. The GSA has used a function of time to determine the number of the best particles for attracting others in each time, while our main idea is based on attracting each particle with two cognitive and social components. The cognitive component contains the best position of the particles up to now, while the social component contains the particle with the best position in the whole of the system at the current time and the particles with the best position in the neighborhood. In the other words, the cognitive component is such an appropriate actuator for embedding in the intelligent agents like robots. Such intelligent agent or robot is guided in the right direction with the help of its best previous position. Finally, by introducing discrete version of this idea, the efficiency of the proposed algorithm is measured for 0-1 knapsack problem. Experimental results on some benchmark and high dimensional problems illustrate that the proposed algorithm has gained the better accuracy in comparison of the other similar methods.
