首页 | 本学科首页   官方微博 | 高级检索  
   检索      


A stochastic gradual cover location problem
Authors:Tammy Drezner  Zvi Drezner  Zvi Goldstein
Institution:Department of Information Systems and Decision Sciences, Steven G. Mihaylo College of Business and Economics, California State University‐Fullerton, Fullerton, California 92834
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
Keywords:location  cover  stochastic  global optimization
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号