1. Главная
  2. Ресурсы
  3. Библиотечный поиск
A (1 + λ)evolutionaryalgorithm with thegreedy agglomerativemutation for p-medianproblems Kazakovtsev LevRozhnov IvanKazakovtsev Vladimir2023 год

A (1 + λ) evolutionary algorithm with the greedy agglomerative mutation for p-median problems
доклад, тезисы доклада, статья из сборника материалов конференций

Дополнительные ссылки: eLibrary · Источник статьи
База данных: Каталог библиотеки СФУ
Библиографическое описание: A (1 + λ) evolutionary algorithm with the greedy agglomerative mutation for p-median problems : доклад, тезисы доклада / L. L. Kazakovtsev, I. I. Rozhnov, V. V. Kazakovtsev. - [S. l. : s. n.], 2023. - Текст : непосредственный // AIP Conference Proceedings : PROCEEDINGS OF THE IV INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCED TECHNOLOGIES IN AEROSPACE, MECHANICAL AND AUTOMATION ENGINEERING: (MIST: Aerospace-IV 2021) / IV INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCED TECHNOLOGIES IN AEROSPACE, MECHANICAL AND AUTOMATION ENGINEERING: (MIST: Aerospace-IV 2021) (2021 ; 10.12 - 11.12 ; Krasnoyarsk). - AIP PABLISHING, 2023. - 2700. - P. 040003. - This work was supported by the Ministry of Science and Higher Education of the Russian Federation (State Contract No. FEFE-2020-0013). - ISBN 9780735444126, 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. However, 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.
Год издания: 2023
Авторы: Kazakovtsev Lev , Rozhnov Ivan , Kazakovtsev Vladimir
Издательство: AIP PABLISHING
Источник: AIP Conference Proceedings
Выпуск: 2700
Мероприятие: IV INTERNATIONAL SCIENTIFIC CONFERENCE ON ADVANCED TECHNOLOGIES IN AEROSPACE, MECHANICAL AND AUTOMATION ENGINEERING: (MIST: Aerospace-IV 2021) (Krasnoyarsk, 2021 ; 10.12 - 11.12)
Номера страниц: 040003
Держатель оригинала документа: ITMO University, Reshetnev Siberian State University of Science and Technology, Siberian Federal University
Количество экземпляров:
Твёрдая копия издания отсутствует в фонде библиотеки

Похожие публикации

Self-adjustingGenetic Algorithmwith GreedyAgglomerativeCrossover forContinuous p-MedianProblems Kazakovtsev L.Rozhnov I.Nasyrov I.2021 год

Self-adjusting Genetic Algorithm with Greedy Agglomerative Crossover for Continuous p-Median Problems : доклад,…

  • Kazakovtsev L. и др.
  • 2021 год
Genetic Algorithmswith theCrossover-LikeMutation Operator forthe k-Means Problem Kazakovtsev L.Shkaberina G.Rozhnov I.2020 год

Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem : доклад, тезисы доклада, статья…

  • Kazakovtsev L. и др.
  • 2020 год
Comparative study oflocal search in SWAPand agglomerativeneighbourhoods forthe continuousp-median problem Kazakovtsev L.A.Rozhnov I.P.2021 год

Comparative study of local search in SWAP and agglomerative neighbourhoods for the continuous p-median problem :…

  • Kazakovtsev L.A. и др.
  • 2021 год
Development andanalysis of adaptivemutation techniquesin genetic algorithms Novikov ZakharSopov Evgenii2025 год

Development and analysis of adaptive mutation techniques in genetic algorithms : доклад, тезисы доклада

  • Novikov Zakhar и др.
  • 2025 год
Clustering Algorithmwith a GreedyAgglomerativeHeuristic and SpecialDistance Measures Shkaberina G.Verenev L.Tovbis E.2022 год

Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures : статья из журнала

  • Shkaberina G. и др.
  • 2022 год
Hybrid algorithmswith alternativeembedded local searchschemes for thep-median problem Rezova NatalyaKazakovtsev LevRozhnov Ivan2023 год

Hybrid algorithms with alternative embedded local search schemes for the p-median problem : научное издание

  • Rezova Natalya и др.
  • 2023 год
Greedy heuristicalgorithm for solvingseries of eeecomponentsclassificationproblem Kazakovtsev A.L.Antamoshkin A.N.Fedosov V.V.2016 год

Greedy heuristic algorithm for solving series of eee components classification problem : доклад, тезисы доклада,…

  • Kazakovtsev A.L. и др.
  • 2016 год
Performance analysisof de mutationschemes forconstrained LSGOproblems Vakhnin A.Sopov E.Kustov D.2019 год

Performance analysis of de mutation schemes for constrained LSGO problems : доклад, тезисы доклада, статья из…

  • Vakhnin A. и др.
  • 2019 год

Показать ещё

Increasing PopulationVariability inParallel GeneticAlgorithms with aGreedy Crossover forLarge-Scale p-Median… Kazakovtsev L.Rozhnov I.Shkaberina G.2021 год

Increasing Population Variability in Parallel Genetic Algorithms with a Greedy Crossover for… : статья из журнала

  • Kazakovtsev L. и др.
  • 2021 год
Combinations of thegreedy heuristicmethod for clusteringproblems and localsearch algorithms Kazakovtsev L.Antamoshkin A.2016 год

Combinations of the greedy heuristic method for clustering problems and local search algorithms : доклад, тезисы доклада

  • Kazakovtsev L. и др.
  • 2016 год
MODIFIED GENETICALGORITHM WITH GREEDYHEURISTIC FORCONTINUOUS ANDDISCRETE P-MEDIANPROBLEMS Kazakovtsev Lev A.Orlov Victor I.Stupina Aljona A.2015 год

MODIFIED GENETIC ALGORITHM WITH GREEDY HEURISTIC FOR CONTINUOUS AND DISCRETE P-MEDIAN PROBLEMS : научное издание

  • Kazakovtsev Lev A. и др.
  • 2015 год
Self-configuring (1 +1)-evolutionaryalgorithm for thecontinuous p-medianproblem withagglomerativemutation Kazakovtsev L.Rozhnov I.Shkaberina G.2021 год

Self-configuring (1 + 1)-evolutionary algorithm for the continuous p-median problem with… : статья из журнала

  • Kazakovtsev L. и др.
  • 2021 год
MODIFIED GENETICALGORITHM WITH GREEDYHEURISTIC FORCONTINUOUS ANDDISCRETE P-MEDIANPROBLEMS Kazakovtsev L.A.Orlov V.I.Stupina A.A.2015 год

MODIFIED GENETIC ALGORITHM WITH GREEDY HEURISTIC FOR CONTINUOUS AND DISCRETE P-MEDIAN PROBLEMS : научное издание

  • Kazakovtsev L.A. и др.
  • 2015 год
COMPARATIVE STUDY OFMUTATION OPERATORS INTHE GENETICALGORITHMS FOR THEK-MEANS PROBLEM Li RuiKazakovtsev Lev A.2021 год

COMPARATIVE STUDY OF MUTATION OPERATORS IN THE GENETIC ALGORITHMS FOR THE K-MEANS PROBLEM : научное издание

  • Li Rui и др.
  • 2021 год
Fast geneticalgorithm with greedyheuristic forp-median and k-meansproblems Kazakovtsev L.A.Stupina A.A.2015 год

Fast genetic algorithm with greedy heuristic for p-median and k-means problems : доклад, тезисы доклада

  • Kazakovtsev L.A. и др.
  • 2015 год
Application ofAlgorithms withVariable GreedyHeuristics fork-Medoids Problems Kazakovtsev LevRozhnov Ivan2020 год

Application of Algorithms with Variable Greedy Heuristics for k-Medoids Problems : статья из журнала

  • Kazakovtsev Lev и др.
  • 2020 год