Constraint handling in probability collectives using a modified feasibility-based rule Online publication date: Tue, 08-Nov-2016
by Anand J. Kulkarni; Neha S. Patankar; Kang Tai
International Journal of Computational Science and Engineering (IJCSE), Vol. 13, No. 4, 2016
Abstract: Almost all existing heuristic techniques are unconstrained optimisation methods and treat the system in centralised way. A distributed and decentralised optimisation technique in the framework of collective intelligence referred to as probability collectives (PCs) decomposes the entire system into subsystems and treats them as a multi-agent system. Similar to other contemporary heuristic techniques, its performance is significantly affected when constraints are involved. In order to handle constraints, a modified feasibility-based rule is incorporated into the PC algorithm. The approach is validated by solving a variety of constrained test problems. A tension/compression spring design problem, welded beam design problem and pressure vessel design problem are also solved. The approach is shown to be sufficiently robust and other strengths and weaknesses are also discussed. The solution to these problems proves that the constrained PC approach can be applied to a variety of practical/real world problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computational Science and Engineering (IJCSE):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook