Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Computers and Operations Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
