minimum sphere Single facility location: Circle covering problemminimum sphereSylvester problem Single facility location: Circle covering problemSylvester’s problemIn 1857 the British mathematician J.J. Sylvester , in a one sentence article [ 28 ], posed the problem: It is required to find the ...
Single facility location problem with region-dependent distance metrics - Parlar - 1994 () Citation Context ...ired. Furthermore, Ω1 would, in general, be nonconvex in shape. A related problem with Euclidean distances on one side and rectilinear distances on the other side of a line has ...
This chapter will focus on the simplest types of location problems, single facility location problem. These problems occur on a regular basis when working, layout problems (e.g., we may need to locate a machine in a shop, or items inside a warehouse). Also, on a larger scale, they can...
Melachrinoudis E,Cullinane,1985,T P.A heuristic approach to the single facility maximin location problem.Int.J.Prod.Res.,1985,(23):523-532Melachrinoudis E,Cullinane,T P. A heuristic approach to the single facility maximin location problem[J].International Journal of Production Research 1985....
P-facility Huff location problem on networks The p-facility Huff location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply ... R Blanquero,E Carrizosa,BG Toth,... - 《European Journal of Operational Research》 被引...
Among various location problems, the p-center and the p-median problems are the most common, where p is an arbitrary positive integer. The objective of the p-center problem is to locate p servers to minimize the maximum service cost among all clients, while the objective of the p-median ...
Z Sinuany‐Stern, A Stulman - 1983 - onlinelibrary.wiley.com The problem to be considered here is a special case where n hazardous points are given on an interval (route), and a facility is to be located within the interval so that its distance from the closest point is maximized. ...
We consider the single-facility ordered median location problem with uncertainty in the parameters (weights) defining the objective function. We study two cases. In the first case, the uncertain weights belong to a region with a finite number of extreme points, and in the second case, they mus...
Summary: The best known first order and second order methods for the Euclidean single facility location problem are Weiszfeld's algorithm and Newton's algorithm, respectively. With only a linear rate of convergence, Weiszfeld's algorithm is a simple closed form iteration formula. With a quadratic ...
single-source capacitated facility locationant colony optimizationThe purpose of this article is to study a Single-Source Capacitated Facility Location Problem, in which each customer can only be supplied from exactly one facility. Given a set of potential locations and the facility capacities, it ...