Modeling Strategies for the Spatial Search Problem
Year: 1993
Type: article
Abstract: ABSTRACT Spatial search is a highly complex decision problem, hi this paper, modeling approaches are developed which alleviate some of the difficulties encountered in analyzing spatial search. A search modeling framework is outlined which states the problem in a sufficiently detailed yet manageable format. Within the framework, an operational model is developed which generates the probability that a feasible search pattern will result in the lowest realized acquisition cost. Solution strategies for the model include Monte Carlo simulation and a pruning rule which can reduce the dimensionality of the problem. Computational experience with the Monte Carlo procedure and the pruning rule is also provided.
Author: Harvey J. Miller
Institution: University of Utah
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: hybrid
Estimated APC paid: $2,740
OpenAlex ID: W2017217792