A Fast Discrete Gravitational Search Algorithm

@article{Shamsudin2012AFD,
  title={A Fast Discrete Gravitational Search Algorithm},
  author={Hasrul Che Shamsudin and Addie Irawan and Zulkifli Ibrahim and Amar Faiz Zainal Abidin and Slamet Wahyudi and Muhammad Arif Abdul Rahim and Kamal Khalil},
  journal={2012 Fourth International Conference on Computational Intelligence, Modelling and Simulation},
  year={2012},
  pages={24-28}
}
This study introduces a variant of Gravitational Search Algorithm (GSA) for discrete optimization problems, namely, Fast Discrete Gravitational Search Algorithm (FDGSA). The main difference between the proposed FDGSA and the existing Binary Gravitational Search Algorithm (BGSA) is that an agent's position is updated based on its direction and velocity. Both the direction and velocity determine the candidates of integer values for the position update of an agent and then the selection is done… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-6 of 6 extracted citations

Crisscross optimization algorithm and its application

Knowl.-Based Syst. • 2014
View 8 Excerpts
Highly Influenced

A Local Exploitation Based Gravitational search algorithm

2017 International Conference on Computer, Communications and Electronics (Comptelix) • 2017
View 1 Excerpt

Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem

Seyedeh Fatemeh Razavia, Hedieh Sajedib
2015
View 1 Excerpt

Synchronous vs Asynchronous Gravitational Search Algorithm

2013 1st International Conference on Artificial Intelligence, Modelling and Simulation • 2013
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Particle Swarm Optimization

J. Kennedy, R. C. Eberhart
In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942-1948,1995. • 1942
View 2 Excerpts

Similar Papers

Loading similar papers…