[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
:: Volume 10, Issue 2 (9-2019) ::
IJOR 2019, 10(2): 78-93 Back to browse issues page
A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Fahimeh Baroughi Dr. , Akram Soltani Mrs. , Behrooz Alizadeh Dr.
Sahand University of Technology , baroughi@sut.ac.ir
Abstract:   (315 Views)
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtain the approximate optimal solution of the proposed model. The algorithm contains the tail value at risk simulation and the expected value simulation. Finally, by computational experiments, the algorithm is illustrated to be efficient.
Keywords: Location problem, p-median, Uncertainty theory, Tail value at risk, Uncertain programming, Binary particle swarm optimization.
Full-Text [PDF 605 kb]   (168 Downloads)    
Type of Study: Original | Subject: Mathematical Modeling and Applications of OR
Received: 2019/08/1 | Accepted: 2019/11/5 | Published: 2019/12/9
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA


XML     Print



Volume 10, Issue 2 (9-2019) Back to browse issues page
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.05 seconds with 30 queries by YEKTAWEB 4241