Introducing Generative adversarial networks on Estimation of distribution algorithm to solve permutation-based problems

As a subclass of evolutionary algorithms, estimation of distribution algorithms (EDAs) have found widespread use in a variety of optimization problems with impressive performance. In each generation, they build a probabilistic model representing the promising individuals, and the next generation con...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2022 International Symposium on iNnovative Informatics of Biskra (ISNIB) S. 1 - 5
Hauptverfasser: Lemtenneche, Sami, Cheriet, Abdelhakim, Bensayah, Abdallah
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 07.12.2022
Schlagworte:
Deep Generative Models
Estimation
Estimation of distribution algorithms
Generative adversarial networks
Permutation
Probabilistic logic
Scheduling
Sociology
Training
Training data
Travelling Salesman Problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:As a subclass of evolutionary algorithms, estimation of distribution algorithms (EDAs) have found widespread use in a variety of optimization problems with impressive performance. In each generation, they build a probabilistic model representing the promising individuals, and the next generation constructs by sampling this model. Constructing and sampling the probabilistic model is a real challenge in developing such algorithms. Generative adversarial networks (GANs) are a popular kind of generative model that has been widely adopted due to their ability to generate new samples that closely match the distribution of training data. However, research on how GANs handle permutation spaces is lacking. We suggest a novel Estimation of Distribution Algorithm (EDA) that uses GANs as a probabilistic model estimator to advance this subject. in order to preserve the information captured from the selected individuals, those promising individuals were represented by a one-hot matrix, then used to train GANs. The proposed algorithm is tested to solve two permutation problems: The Travelling Salesman Problem (TSP) and Permutation Flowshop Scheduling Problem (PFSP). The Experimental results show that the proposed algorithm can obtain the optimal solution in some instances and a near-optimal in others.
DOI:10.1109/ISNIB57382.2022.10075720