Wasp Swarm Algorithm for Dynamic MAX-SAT Problems

Authors:
Pedro C. Pinto;Thomas A. Runkler;João M. Sousa
Affiliations:
Siemens AG, Corporate Technology, Information and Communications, CT IC 4, 81730 Munich, Germany and Technical University of Lisbon, Instituto Superior Técnico, Av. Rovisco Pais, 1049-001 Lis ...;Technical University of Lisbon, Instituto Superior Técnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal;Technical University of Lisbon, Instituto Superior Técnico, Av. Rovisco Pais, 1049-001 Lisbon, Portugal
Venue:
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Year:
2007

Citing 6
Cited 1

Task differentiation in Polistes wasp colonies: a model for self-organizing groups of robots

Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Reactive search, a history-sensitive heuristic for MAX-SAT

Journal of Experimental Algorithmics (JEA)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Local Search Algorithms for SAT: An Empirical Evaluation

Journal of Automated Reasoning
Wasp-like Agents for Distributed Factory Coordination

Autonomous Agents and Multi-Agent Systems
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications

Grey Wolf Optimizer

Advances in Engineering Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a wasp swarm optimization algorithm, which is applied to the dynamic variant of the maximum satisfiability problem, or MAX-SAT. Here, we describe the changes implemented to optimize the dynamic problem and analyze the parameters of the new algorithm. Wasp swarm optimization accomplishes very well the task of adapting to systematic changes of dynamic MAX-SAT instances derived from static problems, and significantly outperforms the local search algorithm used as benchmark.