Algorithms with greedy heuristic procedures for mixture probability distribution separation
For clustering problems based on the model of mixture probability distribution separation, we propose new Variable Neighbourhood Search algorithms (VNS) and evolutionary genetic algorithms (GA) with greedy agglomerative heuristic procedures and compare them with known algorithms. New genetic algorit...
Main Authors: | Kazakovtsev Lev, Stashkov Dmitry, Gudyma Mikhail, Kazakovtsev Vladimir |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2019-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2019/0354-02431800030K.pdf |
Similar Items
-
A greedy heuristic for axial line placement in collections of convex polygons
by: Hagger, Leonard
Published: (2006) -
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks
by: Salim Bouamama, et al.
Published: (2021-02-01) -
A Randomized Greedy Heuristic for Steerable Wireless Backhaul Reconfiguration
by: Nina Skorin-Kapov, et al.
Published: (2021-02-01) -
Extended Worst-Case OSNR Searching Algorithm for Optical Network-on-Chip Using a Semi-Greedy Heuristic With Adaptive Scan Range
by: Yong Wook Kim, et al.
Published: (2020-01-01) -
Additive abstraction-based heuristics
by: Yang, Fan
Published: (2011)