Abstract
Abstract An exact algorithm for the multi-period facility location problem is proposed that efficiently integrates mixed-integer and dynamic programming methods. Two simplification procedures are introduced to reduce the size of the general multi-period facility location problem substantially. Because the proposed algorithm utilizes dynamic programming to obtain the optimal sequence over the entire planning horizon, many near-optimal solutions also become available that are extremely useful for postoptimality analysis. The solution method is tested and compared with a well-known procedure on several problems with varying conditions. The comparisons appear very promising, and the required CPU times by the proposed method are substantially reduced.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
