Authors investigate the p-median location problem on networks and propose a heuristic algorithm which is based on the probability changing method (a special case of the genetic algorithm) for anâ€¦ (More)

Authors propose new genetic algorithm for solving the planar p-median location problem and k-means clustering problem. The ideas of the algorithm are based on the genetic algorithm with greedyâ€¦ (More)

This work is a continuation of our previous papers devoted to exploration of the regular search procedures efficiency in binary search spaces. Here we formulate the problem in a rather general formâ€¦ (More)

In this paper, we investigate application of various options of algorithms with greedy agglomerative heuristic procedure for object clustering problems in continuous space in combination with variousâ€¦ (More)

Algorithms based on using the agglomerative greedy heuristics demonstrate precise and stable results for clustering problems based on kmeans and p-median models. Such algorithms are successfullyâ€¦ (More)

2014 6th International Congress on Ultra Modernâ€¦

2014

A problem of optimal capacity planning of the process production lines (foundry for example) in accordance with a given output plan is considered as a discrete location problem on a network. Theâ€¦ (More)