علی زاده, بهروز

[ 1 ] - الگوریتم رقابت استعماری دودویی برای مدل های مکان یابی تسهیلات نیمه ناخوشایند روی شبکه ها با مشتریان به شکل زیرگراف

[ 2 ] - الگوریتم های بهینه برای مدل های مکان‌یابی 2- مرکز ناخوشایند پشتیبان روی گراف های درختی

In this paper, we investigate the backup undesirable -center location models on tree graphs. The aim is to obtain the best locations on the vertex set of the underlying tree for establishing two undesirable servers so that the expected value of the closest distance from the existing customers to the functioning facilities is maximized under the assumption that any facility may fail with a given...

[ 3 ] - 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...