TITLE

The Facility Location Problem with Limited Distances

AUTHOR(S)
Drezner, Zvi; Mehrez, Avram; Wesolowsky, George O.
PUB. DATE
August 1991
SOURCE
Transportation Science;Aug91, Vol. 25 Issue 3, p183
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper we consider minimum and minimax single facility location problems where the effective service distance becomes a constant when the actual distance attains or exceeds a certain value. Properties of these problems are studied, and algorithms for their solution are presented.
ACCESSION #
7452003

 

Related Articles

  • An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and Barriers. Dearing, P. M.; Segars Jr., R. // Annals of Operations Research;Mar2002, Vol. 111 Issue 1-4, p89 

    This paper considers planar location problems with rectilinear distance and barriers, where the objective function is any convex, nondecreasing function of distance. Such problems have a non-convex feasible region and a non-convex objective function. A modification of the barriers is developed...

  • Sufficient Conditions for Optimal Facility Locations to Coincide. Juel, Henrik; Love, Robert F. // Transportation Science;May80, Vol. 14 Issue 2, p125 

    In some cases multifacility location problems may be solved by verifying a few, simple inequalities involving the interfacility weights. This paper develops certain inequalities which are sufficient conditions for optimality in some multifacility pro b- lems. In the problems considered here,...

  • A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location. Klincewicz, John G.; Luss, Hanan // Transportation Science;Aug87, Vol. 21 Issue 3, p198 

    The multiproduct uncapacitated facility location problem (MUFLP) is a generalization of the classic uncapacitated facility location problem (UFLP). In MUFLP, different products are required by the customers. In addition to the fixed cost for opening a facility, there is an added fixed cost for...

  • Solving Rectilinear Planar Location Problems with Barriers by a Polynomial Partitioning. Dearing, P. M.; Segars Jr., R. // Annals of Operations Research;Mar2002, Vol. 111 Issue 1-4, p111 

    This paper considers planar location problems with rectilinear distance and barriers where the objective function is any convex, nondecreasing function of distance. Such problems have a non-convex feasible region and a nonconvex objective function. Based on an equivalent problem with modified...

  • An Extended Multifacility Minimax Location Problem Revisited. Michelot, C.; Plastria, F. // Annals of Operations Research;Mar2002, Vol. 111 Issue 1-4, p167 

    We consider the following model of Drezner (1991) for the location of several facilities. The weighted sum of distances to all facilities plus a set-up cost is calculated for each separate demand point. The maximal value among these sums is to be minimized. In this note we show that if the...

  • THE OPTIMAL ASSIGNMENT OF FACILITIES TO LOCATIONS BY BRANCH AND BOUND. Gavett, J. W.; Plyter, Norman V. // Operations Research;Mar/Apr66, Vol. 14 Issue 2, p210 

    The problem of assigning facilities to locations consists of the following: in the general case there are n fixed locations to which n facilities must be assigned. Each facility may be assigned to one and only one location. There are n! feasible assignments. The 'distance' between any pair of...

  • A DUAL-BASED PROCEDURE FOR DYNAMIC FACILITY LOCATION. van Roy, Tony J.; Erlenkotter, Donald // Management Science;Oct82, Vol. 28 Issue 10, p1091 

    In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total discounted costs for meeting demands specified over time at various customer locations. We formulate a particular dynamic facility location...

  • A HEURISTIC ALGORITHM AND SIMULATION APPROACH TO RELATIVE LOCATION OF FACILITIES. Armour, Gordon C.; Buffa, Elwood S. // Management Science;Jan1963, Vol. 9 Issue 2, p294 

    This paper presents a new methodology for determining suboptimum relative location patterns for physical facilities. It presents a computer program governed by an algorithm which determines how relative location patterns should be altered to obtain sequentially the most improved pattern with...

  • A CONVEX HULL ALGORITHM FOR SOLVING A LOCATION PROBLEM. LINH, NGUYEN KIEU; MUU, LE DUNG // RAIRO -- Operations Research;Jul2015, Vol. 49 Issue 3, p589 

    An important problem in distance geometry is of determining the position of an unknown point in a given convex set such that its longest distance to a set of finite number of points is shortest. In this paper we present an algorithm based on subgradient method and convex hull computation for...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics