O uso do modelo hipercubo na solução de problemas de localização probabilísticos

The hypercube model is revisited regarding its use in solution methods for probabilistic location problems. This use of the model is relevant in situations in which the randomness in the availability of servers is an important factor to be considered; in some circumstances this randomness can be represented by spatially distributed queues. The model is presented through an illustrative example, for which the equilibrium equations are derived; some measures of performance are also defined. This is followed by the description of an exact and an approximate method for the calculation of these measures. Several probabilistic location models are then studied, which is followed by the analysis of solution methods for these models, with special emphasis given to methods that embed the hypercube model. Although incipient at present, the use of the hypercube model in probabilistic location problems has good potential, for example if embedded into metaheuristics such as simulated annealing and tabu search.

[1]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[2]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[3]  M. Daskin,et al.  Integration of Multiple, Excess, Backup, and Expected Covering Models , 1988 .

[4]  James R. Evans,et al.  A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising , 1981 .

[5]  Richard C. Larson,et al.  Approximating the Performance of Urban Emergency Service Systems , 1975, Oper. Res..

[6]  Mark S. Daskin,et al.  Multiple Vehicle Routing and Dispatching to an Emergency Scene , 1984 .

[7]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[8]  Rajan Batta,et al.  The Maximal Expected Covering Location Problem: Revisited , 1989, Transp. Sci..

[9]  Cem Saydam,et al.  Accurate estimation of expected coverage: A comparative study , 1994 .

[10]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[11]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[12]  C. Revelle,et al.  A Lagrangean heuristic for the maximal covering location problem , 1996 .

[13]  RICHARD C. LARSON,et al.  A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..

[14]  James P. Jarvis,et al.  Modeling co-located servers and dispatch ties in the hypercube model , 1993, Comput. Oper. Res..

[15]  Mark S. Daskin,et al.  APPLICATION OF AN EXPECTED COVERING MODEL TO EMERGENCY MEDICAL SERVICE SYSTEM DESIGN , 1982 .

[16]  R. Swain.  A decomposition algorithm for a class of facility location problems , 1971 .

[17]  Brian T. Downs,et al.  An exact algorithm for the maximal covering problem , 1996 .

[18]  Arthur J. Swersey.  Chapter 6 The deployment of police, fire, and emergency medical units , 1994, Operations research and the public sector.

[19]  Paul C. Nutt,et al.  Context, tactics, and the examination of alternatives during strategic decision making , 2000, Eur. J. Oper. Res..

[20]  Kendall E. Atkinson.  An introduction to numerical analysis , 1978 .

[21]  Brian Boffey,et al.  A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem , 2000, Eur. J. Oper. Res..

[22]  Charles ReVelle,et al.  Concepts and applications of backup coverage , 1986 .

[23]  Oded Berman,et al.  Optimal Server Location on a Network Operating as an M/G/1 Queue , 1985, Oper. Res..

[24]  Oded Berman,et al.  The Stochastic Queue p-Median Problem , 1987, Transp. Sci..

[25]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

[26]  L. A. Lorena,et al.  A surrogate heuristic for set covering problems , 1994 .

[27]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[28]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[29]  Reinaldo Morabito,et al.  Aplicação do modelo hipercubo para análise de um sistema médico-emergencial em rodovia , 2000 .

[30]  Luiz Antonio Nogueira Lorena,et al.  Relaxation heuristics for a generalized assignment problem , 1996 .

[31]  Charles S. ReVelle,et al.  The Maximum Availability Location Problem , 1989, Transp. Sci..

[32]  Jonathan Halpern.  The Accuracy of Estimates for the Performance Criteria in Certain Emergency Service Queueing Systems , 1977 .

[33]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[34]  Kathleen Hogan,et al.  The maximum reliability location problem and α-reliablep-center problem: Derivatives of the probabilistic location set covering problem , 1990 .