Premium
MODELING SEARCH PROCESSES IN SPACE
Author(s) -
Maier Gunther
Publication year - 1991
Publication title -
papers in regional science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.937
H-Index - 64
eISSN - 1435-5957
pISSN - 1056-8190
DOI - 10.1111/j.1435-5597.1991.tb01724.x
Subject(s) - travelling salesman problem , interdependence , space (punctuation) , mathematical optimization , computer science , mathematics , theoretical computer science , sociology , operating system , social science
The paper extends the well known economic search model to take into account the fact that all search takes place in two‐dimensional space. This adds a routing problem to the stopping problem usually discussed in the search literature. The paper shows that these two problems are interdependent and can only be solved simultaneously. This relates the spatial search problem as it is discussed in this paper to NP‐Complete problems like the traveling salesman problem, some of the most complex problems in mathematics. The paper discusses this relationship and closes with some suggestions about how to circumvent this complexity.