Solving constrained optimization problems using probability collectives and a penalty function approach

DOI10.1142/S1469026811003185MaRDI QIDQ4650013zbMATH OpenFDO

Authors Anand J. Kulkarni, K. Tai

Publication date 15 November 2012

Published in International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1469026811003185

zbMATH Keywords

collective intelligencemulti-agent systemNash equilibriumprobability collectivessociophysics

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Probability collectives with compensate sampling and smooth factors
• Ant colony approach to constrained redundancy optimization in binary systems
• A double-multiplicative dynamic penalty approach for constrained evolutionary optimization
• Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
• A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method

Cites work

• Adopt: asynchronous distributed constraint optimization with quality guarantees
• An application of swarm optimization to nonlinear programming
• An efficient constraint handling method for genetic algorithms
• Constraint handling in genetic algorithms using a gradient-based repair method
• Cultured differential evolution for constrained optimization
• Derivative-free filter simulated annealing method for constrained continuous global optimization
• scientific article; zbMATH DE number 3382096 (Why is no real title available?)
• Min-Cost Selfish Multicast With Network Coding
• Multiagent learning using a variable learning rate
• ON THE USE OF INTELLIGENT AGENTS TO GUIDE TEST SEQUENCE SELECTION AND OPTIMIZATION
• Optimization of trusses using genetic algorithms for discrete and continuous variables

Cited in

(3)

• Probability collectives with compensate sampling and smooth factors
• An Improved Cohort Intelligence with Panoptic Learning Behavior for Solving Constrained Problems
• A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure

This page was built for publication: Solving constrained optimization problems using probability collectives and a penalty function approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650013)