This paper addresses a multiple objective optimization model to determine the file allocation and query routing assignment in a distributed information system. The problem is formulated as a zero-one integer nonlinear programming problem with multiple objectives. The optimization problem under consideration is shown to be NP-hard. We adopt an iterative improvement procedure, which gives the Pareto optimal solution. We further illustrate our methodology with a small sample system.