|
A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
|
اکرم سلطانی    ، بهروز علیزاده |
|
|
|
چکیده: (7802 مشاهده) |
| 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. |
|
| |
|
|
متن کامل [PDF 605 kb]
(11671 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Mathematical Modeling and Applications of OR
دریافت: 1398/5/10 | پذیرش: 1398/8/14 | انتشار: 1398/9/18
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
