MODIFIED GENETIC ALGORITHM WITH GREEDY HEURISTIC FOR CONTINUOUS AND DISCRETE P-MEDIAN PROBLEMS

Описание

Год издания: 2015

Ключевые слова: Genetic algorithm, location problem, p-median problem, Probability Changing Method

Аннотация: 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 performПоказать полностьюance. 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

Выпуск журнала: Vol. 30, Is. 1

Номера страниц: 89-106

ISSN журнала: 03529665

Место издания: NIS

Издатель: UNIV NIS

Авторы

  • Kazakovtsev Lev A. (Siberian State Aerosp Univ, Prosp Krasnoyarskiy Rabochiy 31, Krasnoyarsk 660014, Russia; Siberian Fed Univ, Krasnoyarsk 660041, Russia)
  • Orlov Victor I. (TTC NPO PM, Zheleznogorsk 662970, Krasnoyarskii K, Russia)
  • Stupina Aljona A. (Siberian State Aerosp Univ, Prosp Krasnoyarskiy Rabochiy 31, Krasnoyarsk 660014, Russia; Siberian Fed Univ, Krasnoyarsk 660041, Russia)
  • Kazakovtsev Vladimir L. (Novosibirsk State Univ, Distant Sch, Specialized Educ & Sci Ctr, Novosibirsk 630090, Russia)

Вхождение в базы данных