Particle swarm optimisation based Diophantine equation solver
by Siby Abraham, Sugata Sanyal, Mukund Sanglikar
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 2, 2010

Abstract: The paper introduces particle swarm optimisation as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solutions. The proposed methodology uses a population of integer particles. The candidate solutions in the feasible space are optimised to have better positions through particle best and global best positions. The methodology, which follows fully connected neighbourhood topology, can offer many solutions of such equations.

Online publication date: Wed, 10-Mar-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com