Papers
Topics
Authors
Recent
Search
2000 character limit reached

TOPSIS-like metaheuristic for LABS problem

Published 8 Nov 2025 in cs.NE and math.OC | (2511.05778v1)

Abstract: This paper presents the application of socio-cognitive mutation operators inspired by the TOPSIS method to the Low Autocorrelation Binary Sequence (LABS) problem. Traditional evolutionary algorithms, while effective, often suffer from premature convergence and poor exploration-exploitation balance. To address these challenges, we introduce socio-cognitive mutation mechanisms that integrate strategies of following the best solutions and avoiding the worst. By guiding search agents to imitate high-performing solutions and avoid poor ones, these operators enhance both solution diversity and convergence efficiency. Experimental results demonstrate that TOPSIS-inspired mutation outperforms the base algorithm in optimizing LABS sequences. The study highlights the potential of socio-cognitive learning principles in evolutionary computation and suggests directions for further refinement.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.