A modified particle swarm optimization algorithm for location problem

International Workshop "Advanced Technologies in Material Science, Mechanical and Automation Engineering – MIP: Engineering – 2019"

材料科学;机械制造;原子能学

Osinuga, I.A.^1 ; A.A., Bolarinwa ; L.A., Kazakovtsev

Federal University of Agriculture, PMB 2240 Alabata Road, Abeokuta, Nigeria^1

Reshetnev Siberian State University of Science and Technology, 31 Krasnoyarskiy Rabochiy av., Krasnoyarsk

660037, Russia^2

Siberian Federal University, 79 Svobodny av., Krasnoyarsk

660041, Russia^3

关键词: Global search ability;    Industrial enterprise;    Location problems;    Modified particle swarm optimization;    Modified particle swarm optimization algorithms;    Optimal solutions;    Production batches;    Weighted distance;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/537/4/042060/pdf
DOI  :  10.1088/1757-899X/537/4/042060

学科分类：材料科学（综合）

来源: IOP

【 摘 要 】

In the Weber location problem which was proposed for optimal location of industrial enterprises, the aim is to find the location of a point such that the sum of weighted distance between this point and a finite number of existing points is minimized. This popular model is widely used for optimal location of equipment and in many sophisticated models of cluster analysis such as detecting homogeneous production batches made from a single production batch of raw materials. The well-known iterative Weiszfeld does not converge efficiently to the optimal solution when the solution either coincides or nearly coincides with one of the demands point which is not the optimum. We propose a modified Particle Swarm Optimization (PSO) algorithm. The velocity update of the PSO is modified to enlarge the search space and enhance the global search ability. The preliminary results of these algorithms are analyzed and compared.