Name
Title | ||
|---|---|---|
Solving Constrained Optimization Problems Using Probability Collectives And A Penalty Function Approach |
Abstract | ||
|---|---|---|
The best option to deal with a complex system that is too cumbersome to be treated in a centralized way is to decompose it into a number of sub-systems and optimize them in a distributed and decentralized way to reach the desired system objective. These sub-systems can be viewed as a multi-agent system (MAS) with self-learning agents. Furthermore, another challenge is to handle the constraints involved in real world optimization problems. This paper demonstrates the theory of probability collectives (PC) in the collective intelligence (COIN) framework, supplemented with a penalty function approach for constraint handling. The method of deterministic annealing in statistical physics, game theory and Nash equilibrium are at the core of the PC optimization methodology. Three benchmark problems have been solved with the optimum results obtained at reasonable computational cost. The evident strengths and weaknesses are also discussed to determine the future direction of research. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S1469026811003185 | INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS |
Keywords | Field | DocType |
Probability collectives, multi-agent system, collective intelligence, Nash equilibrium, sociophysics | Mathematical optimization,Collective intelligence,Computer science,Multi-agent system,Artificial intelligence,Game theory,Nash equilibrium,Strengths and weaknesses,Optimization problem,Machine learning,Penalty method | Journal |
Volume | Issue | ISSN |
10 | 4 | 1469-0268 |
Citations | PageRank | References |
10 | 0.56 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anand J. Kulkarni | 1 | 60 | 4.27 |
| K. Tai | 2 | 177 | 22.25 |