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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithms Vol. 14; no. 5; p. 130
Main Authors:	Kazakovtsev, Lev, Rozhnov, Ivan, Shkaberina, Guzel
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.05.2021
Subjects:	(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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!