Self-Configuring (1 + 1)-Evolutionary Algorithm for the Continuous p-Median Problem with Agglomerative Mutation

The continuous p-median problem (CPMP) is one of the most popular and widely used models in location theory that minimizes the sum of distances from known demand points to the sought points called centers or medians. This NP-hard location problem is also useful for clustering (automatic grouping). I...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithms Jg. 14; H. 5; S. 130
Hauptverfasser:	Kazakovtsev, Lev, Rozhnov, Ivan, Shkaberina, Guzel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.05.2021
Schlagworte:	(1 + 1)-EA Agglomeration Clustering Demand Efficiency Evolutionary algorithms evolutionary computation Genetic algorithms Greedy algorithms Heuristic location problems Mathematical models Mutation Optimization Outliers (statistics) p-median Parameters Search algorithms Site selection Software
ISSN:	1999-4893, 1999-4893
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!