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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithms Ročník 14; číslo 5; s. 130
Hlavní autori:	Kazakovtsev, Lev, Rozhnov, Ivan, Shkaberina, Guzel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.05.2021
Predmet:	(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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!