Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: IV INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCED TECHNOLOGIES IN AEROSPACE, MECHANICAL AND AUTOMATION ENGINEERING: (MIST: Aerospace-IV 2021); Krasnoyarsk; Krasnoyarsk
Год издания: 2023
Идентификатор DOI: 10.1063/5.0124952
Аннотация: We consider the continuous p-median problem which is a popular mathematical model for both facility location and cluster analysis. For the p-median problems as well as very similar k-means problems, genetic and Variable Neighborhood Search algorithms with the greedy agglomerative heuristic procedure demonstrate their efficiency. HoПоказать полностьюwever, the operation of such algorithms highly depends on the parameter of such procedure. We propose a new (1 + λ) evolutionary algorithm involving the greedy agglomerative procedure as the mutation operator which adjusts the parameter of this procedure during the operation of the algorithm. The advantage of the new algorithm was demonstrated by several examples including large-scale ones.
Журнал: AIP Conference Proceedings
Выпуск журнала: 2700
Номера страниц: 040003
Место издания: AIP PABLISHING