منابع مشابه
P-Median: A Performance Analysis
This work approaches the P-median problem with a partitioning around medoids methodology. This problem has been extensively studied because of the multiple applications and its NP-hard nature; therefore several are the efforts to find optimal solutions. In this paper we consider two case studies: 1) instances from OR-Library and 2) geographical objects from the metropolitan zone of Toluca, Mexi...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملThe p-Median Problem
The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is NP-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem. Basic construction and improvement algorithms are outlined. Results from the lite...
متن کاملThe Hamiltonian p-Median Problem
We deal, from a theoretical point of view, with the asymmetric Hamiltonian p–median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILP-formulation based on a new class of inequalities (subtour number constraints) is presented. The associated Hamiltonian p–median polytope is examined, in particular its dimension and its affine hull. We d...
متن کاملA population based hybrid metaheuristic for the p-median problem A population based hybrid metaheuristic for the p-median problem
The p-median problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients such that the overall cost is minimised. In this paper, PBS, a population based hybrid search algorithm for the p-median problem is introduced. The PBS algorithm uses a genetic algorithm based meta-heuristic, primarily based on cut and paste crossover operators, to generate new star...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Computing Science
سال: 2014
ISSN: 1870-4069
DOI: 10.13053/rcs-88-1-2