Baroughi, Fahimeh

Sahand University of Technology

[ 1 ] - A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem

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 obtai...

[ 2 ] - The robust vertex centdian location problem with interval vertex weights on general graphs

In this paper, the robust vertex centdian  location  problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max  regret criterion. This problem  is  investigated  with objective function contains $lambda$  and  a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...