نتایج جستجو برای: median p
تعداد نتایج: 1353968 فیلتر نتایج به سال:
We present an efficient metaheuristic based on Simulated Annealing for solving the p-Median problem. These ideas are tested on the well known OR-Lib set of problems with excellent results.
Given n customers and a set F of m potential facilities, the p-median problem consists in finding a subset of F with p facilities such that the cost of serving all customers is minimized. This is a well-known NP-complete problem with important applications in location science and classification (clustering). We present a multistart hybrid heuristic that combines elements of several traditional ...
A customer is presumed to gravitate to a facility by the distance to it and the attractiveness of it. However regarding the location of the facility, the presumption is that the customer opts for the shortest route to the nearest facility. This paradox was recently solved by the introduction of the gravity p-median model. The model is yet to be implemented and tested empirically. We implemented...
This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase of exploration. The procedures have been coded in C using OpenMP and compared in a shared memory ...
Given a set of clients and a set of potential sites for facilities, the p-median problem consists of opening a set of p sites and assigning each client to the closest open facility to it. It can be viewed as a variation of the uncapacitated facility location problem. We propose a new formulation of this problem by a mixed integer linear problem. We show that this formulation, while it has the s...
Abstract This paper deals with an interesting facility location problem known as the bi-objective p -Median and -Dispersion ( BpMD problem). The seeks to locate facilities service a set of n demand points, goal is minimize total distance between points and, simultaneously, maximize minimum all pairs hosted facilities. addressed novel path relinking approach, called reactive relinking, which hyb...
The p-median offers an alternative to centroid-based clustering algorithms for identifying unobserved categories. However, existing p-median formulations typically require data aggregation into a single proximity matrix, resulting in masked respondent heterogeneity. A proposed three-way formulation of the p-median problem explicitly considers heterogeneity by identifying groups of individual re...
Authors investigate the p-median location problem on networks and propose a heuristic algorithm which is based on the probability changing method (a special case of the genetic algorithm) for an approximate solution to the problem. The ideas of the algorithm are proposed under the assumption that, in the largescale networks with comparatively small edge lengths, the p-median problem has feature...
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید