Custo de estoque/inventrio em cenrios com grande volatilidade nos preos Versus cenri

o de preos estveis. Muda alguma coisa?

Primeiros trabalhos de localizao
Kuehn e Hamburger (1963)
Kuehn, A. A., Hamburger, M. J., 1963. A heuristic program for locating warehouse
s. Management Sciences 9, 643-666.
Abstract
The linear programing algorithms available for optimizing the routing of shipmen
ts in multi-plant, multi-destination systems cannot, in the current state of kno
wledge, be applied directly to the more general problem of determining the numbe
r and location of regional warehouses in large-scale distribution networks.
This paper outlines a heuristic computer program for locating warehouses and com
pares it with recently published efforts at solving the problem either by means
of simulation or as a variant of linear programing. The heuristic approach outli
ned in this paper appears to offer significant advantages in the solution of thi
s class of problems in that it (1) provides considerable flexibility in the spec
ification (modeling) of the problem to be solved, (2) can be used to study large
-scale problems, that is, complexes with several hundred potential warehouse sit
es and several thousand shipment destinations, and (3) is economical of computer
time. The results obtained in applying the program to small scale problems have
been equal to or better than those provided by the alternative methods consider
ed.
Efroymson e Ray (1966)
Efroymson MA, Ray TL (1966) A branch and bound algorithm for plant location. Ope
r Res
14:361 368
Abstract
This paper discusses an integer-programming method for solving a special class o
f discrete programming problems called plant location. The basic contribution is
that the problem is formulated as an integer program in such a way that the ass
ociated continuous problem can be efficiently optimized. A branch-bound algorith
m is then used to solve the problem. The method discussed in the article has bee
n successfully used to solve practical location problems with upwards of fifty pla
nts.
Spielberg (1969)
Spielberg K (1969) Algorithms for the simple plant location problem with some si
de constraints.
Oper Res 17:85 111
Abstract
The algorithms of this paper belong to the direct-search or implicit-enumeration
type. They compare to the recently proposed algorithm of Efroymson and Ray, as
does the mixed integer algorithm proposed by C. E. Lemke and the author to that
of Land and Doig. The general plan of procedure is expected to be equally valid
for the capacitated plant-location problem and for transshipment problems with f
ixed charges; with some of the proposed devices more important for these difficu
lt problems than for the simple plant location problem. Considerable computation
al experience has been accumulated and is discussed at some length. It suggests
that additional work on the construction of adaptive programs, matching algorithm
to data structure, is desirable.