In this paper, we propose the planar obnoxious facilities p-median problem. problem objective is to find p locations for that minimize weighted sum of distances between communities and their closest facility. version, add constraints each facility must be located at least a certain distance from partial set because they generate nuisance affecting these communities. The resulting extremely non-...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

The p-median problem has been widely studied in the literature during the last decades especially its linear version. We propose a capacitated p-median problem with concave costs, in which the global cost incurred for each established facility is a concave function of the quantity q delivered by this facility. The unit distribution cost decreases with the increased quantity of output or demand ...

The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve...

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

Lp-norm weighted depth functions are introduced and the local and global robustness of these weighted Lp-depth functions and their induced multivariate medians are investigated via influence function and finite sample breakdown point. To study the global robustness of depth functions, a notion of finite sample breakdown point is introduced. The weighted Lp-depth functions turn out to have the s...