Evaluation of Particle Swarm Optimization Algorithms for Weighted Max-Sat Problem: Technical Report
Osama Khalil

TL;DR
This paper experimentally compares four Particle Swarm Optimization neighborhood structures on the Max-Sat problem, finding no statistically significant performance differences among them.
Contribution
It provides an empirical assessment of different PSO neighborhood structures for Max-Sat, highlighting their comparable effectiveness.
Findings
No significant performance difference among the algorithms
All algorithms perform similarly under the tested conditions
The study offers insights into PSO application for Max-Sat
Abstract
An experimental evaluation is conducted to asses the performance of 4 different Particle Swarm Optimization neighborhood structures in solving Max-Sat problem. The experiment has shown that none of the algorithms achieves statistically significant performance over the others under confidence level of 0.05.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Vehicle Routing Optimization Methods · Optimization and Packing Problems
