A MODIFIED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR GENERAL INVERSE ORDERED p-MEDIAN LOCATION PROBLEM ON NETWORKS

Facta Universitatis. Series Mathematics and Informatics

Iden Mirzapolis Adeh¹  Behrooz Alizadeh¹  Fahimeh Baroughi¹ 

[1] Sahand University of Technology

关键词: location problem;    inverse optimization;    ordered p-median;    particle swarm optimization algorithm;   

DOI  :  10.22190/FUMI1704447M

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Nishu / University of Nis

【 摘 要 】

This paper is concerned with a general inverse ordered p-median location problem on network where the task is to change (increase or decrease) the edge lengths and vertex weights at minimum cost subject to given modification bounds such that a given set of p vertices becomes an optimal solution of the location problem, i.e., an ordered p-median under the new edge lengths and vertex weights. A modified particle swarm optimization algorithm is designed to solve the problem under the cost functions related to the sum-type Hamming, bottleneck-type Hamming distances and the recti-linear and Chebyshev norms. By computational experiments, the high efficiency of the proposed algorithm is illustrated.

【 授权许可】

Unknown