An ant algorithm for solving stochastic programming model of facility location problem in three-echelon supply chain of TFT-LCD Industry
碩士 === 國立東華大學 === 企業管理學系 === 94 === This research addresses the issue of facility location problem at a TFT-LCD manufacturing firm while the demand of the customers are stochastic. This problem includes locating a number of factories among a finite set of potential sites, in order to maximize the ne...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02956605349359692777 |
| Summary: | 碩士 === 國立東華大學 === 企業管理學系 === 94 === This research addresses the issue of facility location problem at a TFT-LCD manufacturing firm while the demand of the customers are stochastic. This problem includes locating a number of factories among a finite set of potential sites, in order to maximize the net profit, the total profit minus the facility costs and transportation costs.
The study first represents the addressed facility location problem as a stochastic programming model and proposes two sets of ant algorithm, AAFLOP (Ant Algorithm for Location Problem) and TAAFLOP (Thoughtful AAFLOP), to solve the binary variables of the proposed model and use a greedy method to solve the continuous variables of the model. Experiments reveal that the proposed ant algorithms can efficiently find near optimal solutions against stochastic demands.
|
|---|