Fast Genetic Algorithm with Greedy Heuristic for p-Median and k-Means Problems

被引：0
|
作者：
Kazakovtsev, Lev A. [1 ]
Stupina, Aljona A. [1 ]
机构：
[1] Siberian State Aerosp Univ, Inst Comp Sci & Telecommun, Krasnoyarsk, Russia
来源：
2014 6TH INTERNATIONAL CONGRESS ON ULTRA MODERN TELECOMMUNICATIONS AND CONTROL SYSTEMS AND WORKSHOPS (ICUMT) | 2014年
关键词：
k-means; location problem; genetic algorithm; cluster analysis;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The genetic algorithm with greedy heuristic, initially developed for solving location problems on networks, can be adapted for solving continuous problems such as k-means. However, the efficiency of such algorithm in case of continuous problems does not allow to use it for solving the large-scale problems. In this paper, authors propose a modification to this algorithm which allows such algorithm to work faster.
引用
收藏
页码：602 / 606
页数：5
相关论文
共 50 条
  • [41] On K-means Data Clustering Algorithm with Genetic Algorithm
    Kapil, Shruti
    Chawla, Meenu
    Ansari, Mohd Dilshad
    2016 FOURTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (PDGC), 2016, : 202 - 206
  • [42] Data aggregation for p-median problems
    AlBdaiwi, Bader F.
    Ghosh, Diptesh
    Goldengorin, Boris
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (03) : 348 - 363
  • [43] A trajectory based heuristic for the planar P-median problem
    Drezner, Zvi
    Brimberg, Jack
    Schoebel, Anita
    COMPUTERS & OPERATIONS RESEARCH, 2023, 158
  • [44] Ordered p-median problems with neighbourhoods
    Víctor Blanco
    Computational Optimization and Applications, 2019, 73 : 603 - 645
  • [45] An Alternative Heuristic for Capacitated P-median Problem (CPMP)
    Shariff, S. Sarifah Radiah
    Moin, Noor Hasnah
    Omar, Mohd
    2013 IEEE BUSINESS ENGINEERING AND INDUSTRIAL APPLICATIONS COLLOQUIUM (BEIAC 2013), 2013, : 916 - 921
  • [46] On solving large p-median problems
    Mu, Wangshu
    Tong, Daoqin
    ENVIRONMENT AND PLANNING B-URBAN ANALYTICS AND CITY SCIENCE, 2020, 47 (06) : 981 - 996
  • [47] TESTING OF TREE-SEED ALGORITHM ON P-MEDIAN BENCHMARK PROBLEMS
    Eliguzel, Ibrahim Mirac
    Ozceylan, Eren
    Cetinkaya, Cihan
    SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, 2019, 37 (04): : 1417 - 1430
  • [48] Clustering search heuristic for the capacitated p-median problem
    Chaves, Antonio Augusto
    Correa, Francisco de Assis
    Lorena, Luiz Antonio N.
    INNOVATIONS IN HYBRID INTELLIGENT SYSTEMS, 2007, 44 : 136 - +
  • [49] Exact and heuristic algorithms for the Hamiltonian p-median problem
    Erdogan, Gunes
    Laporte, Gilbert
    Rodriguez Chia, Antonio M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (02) : 280 - 289
  • [50] Clustering with Niching Genetic K-means algorithm
    Sheng, WG
    Tucker, A
    Liu, XH
    GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS, 2004, 3103 : 162 - 173
12345