Open AccessRandom Search Algorithm for the Generalized Weber Problem
Author(s) -
Lev Kazakovtsev
Publication year - 2012
Publication title -
journal of software engineering and applications
Language(s) - English
Resource type - Journals
eISSN - 1945-3124
pISSN - 1945-3116
DOI - 10.4236/jsea.2012.512b013
Subject(s) - multiprocessing , algorithm , euclidean geometry , mathematical optimization , euclidean distance , computer science , genetic algorithm , planar , cluster (spacecraft) , mathematics , parallel computing , artificial intelligence , geometry , computer graphics (images) , programming language
In this paper, we consider the planar multi-facility Weber problem with restricted zones and non-Euclidean distances, propose an algorithm based on the probability changing method (special kind of genetic algorithms) and prove its efficiency for approximate solving this problem by replacing the continuous coordinate values by discrete ones. Version of the algorithm for multiprocessor systems is proposed. Experimental results for a high-performance cluster are given.