1. Главная
  2. Ресурсы
  3. Библиотечный поиск
A stochastic gradualcover locationproblem Tammy DreznerZvi DreznerZvi Goldstein2010 год

A stochastic gradual cover location problem
статья из журнала

Страница публикацииПубликация в OpenAlex
Аннотация: Abstract Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010
Год издания: 2010
Авторы: Tammy Drezner, Zvi Drezner, Zvi Goldstein
Издательство: Wiley
Источник: Naval Research Logistics (NRL)
Ключевые слова: Facility Location and Emergency Management, Vehicle Routing Optimization Methods, Computational Geometry and Mesh Generation