Am improved algorithm for solving a multi-period facility location problem.: An article from: IIE Transactions

This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on February 1, 1996. The length of the article is 7478 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: 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.

Citation Details
Title: Am improved algorithm for solving a multi-period facility location problem.
Author: Amir M. Hormozi
Publication:IIE Transactions (Refereed)
Date: February 1, 1996
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: v28 Issue: n2 Page: p105(10)

Distributed by Thomson Gale