A new vision of social behavior on genetic algorithm performance
A new vision of social behavior on genetic algorithm performance
Andreea Tatar, Nicolae Fat, Adrian Petrovan, Oliviu Matei
Abstract. Genetic algorithms (GAs) are typically described in terms of mutation, crossover and selection, but the social dynamics that arise inside the population are often abstracted away. This paper proposes a new vision in which the performance of genetic algorithms is analysed through the lens of social behavior of individuals. Individuals are characterised by behavioural traits that influence how they interact during crossover, how information is exchanged and how solutions diversify. Experimental results on classical combinatorial optimisation problems indicate that incorporating social-behavior inspired operators leads to improved exploration capabilities and to better-quality solutions compared with traditional GA implementations.
Keywords: genetic algorithms; social behavior; metaheuristics; population dynamics; combinatorial optimisation
📋 Cite this publication
Andreea Tatar, Nicolae Fat, Adrian Petrovan, Oliviu Matei, "A new vision of social behavior on genetic algorithm performance", Proc. 19th SOCO Int. Conf. on Soft Computing Models in Industrial and Environmental Applications, Springer, 2024, 2023.
Reference: Proc. 19th SOCO Int. Conf. on Soft Computing Models in Industrial and Environmental Applications, Springer, 2024.
TPC Net: An Efficient CNN Architecture for Tomato Plant Disease and Pest Classification
TPC Net: An Efficient CNN Architecture for Tomato Plant Disease and Pest ClassificationOvidiu...
Enhancing API Security Testing against BOLA and Authentication Vulnerabilities through an LLM-Enhanced Framework
Enhancing API Security Testing against BOLA and Authentication Vulnerabilities through an...
A comparative study of different genetic algorithms approaches to capacitated vehicle routing problem for collection of agricultural products
A comparative study of different genetic algorithms approaches to capacitated vehicle routing...
Using Machine Learning for Identifying the Intrinsic Economic Specializations of Localities
Using Machine Learning for Identifying the Intrinsic Economic Specializations of LocalitiesOliviu...
Evaluation of Feature Selection Methods in Estimation of Precipitation Based on Deep Learning Artificial Neural Networks
Precipitation is the most important element of the water cycle and an indispensable element of water resources management. This paper aims to model the monthly precipitation in 8 precipitation observation stations. The effects and role of different feature weights pre-processing methods (Weight by deviation, Weight by PCA, Weight by correlation, and Weight by Support Vector Machine) on artificial intelligence modeling were investigated.
A Comparison of different crossover operators in genetic algorithms for clusters shortest-path tree problem
The clustered shortest-path tree (CluSPT) problem is an extension of the classical shortest path problem, given a graph with the nodes partitioned into several mutually exclusive and collectively exhaustive clusters looks for a shortest-path spanning tree from a predefined source node to all the other nodes of the graph, with the property that every cluster should generate a connected subgraph.
A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical traveling salesman
problem (TSP), and it is among the most researched combinatorial optimization problems due to its theoretical properties, complexity aspects, and real-life applications in various areas: location-routing problems, material flow design problem, distribution of medical supplies, urban waste collection management, airport selection and routing the courier airplanes, image retrieval and ranking, digital garment manufacturing, etc.
A hybrid based genetic algorithm for solving the clustered generalized traveling salesman problem
We study the clustered generalized traveling salesman problem (CGTSP), which is an extension of the generalized traveling salesman problem (GTSP), which in turn generalizes the well-known traveling salesman problem (TSP).
0 Comments