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

in this paper smart operation of micro energy hub is presented. energy hub system consists of certain energy hubs and interconnectors that are coordinated by energy hub system operator. an energy hub contains several converters and storages to serve demanded services in most efficient manner from available energy carriers. in this paper, the flexibility of energy delivery point is enhanced u...

This paper deals with an approximate approach to the p-median problem. Large instances of the p-median problem can be often met when a real public service system is designed and the discomfort of its customers is minimized. If a large instance of the p-median problem is described by a location-allocation model, then the size of a model often exceeds the acceptable limit for available optimizati...

Regarding the location of a facility, the presumption in the widely used p-median model is that the customer opts for the shortest route to the nearest facility. However, this assumption is problematic on free markets since the customer is presumed to gravitate to a facility by the distance to and the attractiveness of it. The recently introduced gravity p-median model offers an extension to th...

To avoid the undesired effects of distance concentration in high-dimensional spaces, previous work has already advocated the use of fractional p norms instead of the ubiquitous Euclidean norm. Closely related to concentration is the emergence of hub and anti-hub objects. Hub objects have a small distance to an exceptionally large number of data points while anti-hubs lie far from all other data...

A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...