Abstract
AbstractIn this paper we consider the dynamic file allocation problem, where query and update costs vary from one time period to the next. We develop a mixed integer linear program to model this problem. The model incorporates startup costs which are incurred if a location maintains a file copy in a given time period, but did not maintain it the previous time period. We develop a branch-and-bound algorithm to solve this problem optimally. Our algorithm uses a new nested dual ascent procedure to solve the dual of the LP relaxation quickly and provide good feasible solutions. Our computational results show that the proposed solution procedure outperforms MPSX by many orders of magnitude and is able to solve large problems in a reasonable amount of time.
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 callMore From: INFOR: Information Systems and Operational 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.
