It is possible to develop ranking algorithms without an explicit retrieval model
through trial and error. Using a retrieval model, however, has generally proved to
be the best approach. Retrieval models, like all mathematical models, provide a framework for defining new tasks and explaining assumptions. When problems
are observed with a ranking algorithm, the retrieval model provides a structure
for testing alternatives that will be much more efficient than a brute force (try everything)
approach.