Тип публикации: статья из журнала
Год издания: 2015
Ключевые слова: location problem, p-median problem, Probability Changing Method, genetic algorithm
Аннотация: t. Genetic algorithm with greedy heuristic is an efficient method for solving largescale location problems on networks. In addition, it can be adapted for solving continuous problems such as k-means. In this article, authors propose modifications to versions of this algorithm on both networks and continuous space improving its perfПоказать полностьюormance. The Probability Changing Method was used for initial seeding of the centers in case of the p-median problem on networks. Results are illustrated by numerical examples and practical experience of cluster analysis of semiconductor device production lots.
Журнал: Facta Universitatis, Series: Mathematics and Informatics
Выпуск журнала: Т. 30, № 1
Номера страниц: 89-105
ISSN журнала: 03529665
Место издания: Белград