|
A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
|
Fahimeh Baroughi *   , Akram Soltani  , Behrooz Alizadeh |
| Sahand University of Technology , baroughi@sut.ac.ir |
|
|
Abstract: (7706 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]
(11415 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 |
|
|
|
