Optimizing search engines results using linear programming

When a query is passed to multiple search engines, each search engine returns a ranked list of documents. Researchers have demonstrated that combining results, in the form of a “metasearch engine”, produces a significant improvement in coverage and search effectiveness. This paper proposes a linear programming mathematical model for optimizing the ranked list result of a given group of Web search engines for an issued query. An application with a numerical illustration shows the advantages of the proposed method.

► Formulates the problem of aggregation multiple search engines results using a linear programming model.
► Emphasizes on the role of finding the optimal weights in the process of aggregation.
► Gives a numerical illustration for aggregation of search engines resulted documents.