| Summary: | 碩士 === 國立高雄第一科技大學 === 運輸倉儲營運所 === 93 === Most of the conventional facilities location problems used Euclid distance to form the main goal while solving the optimal problem. However, it is not realistic when implementing the real world case. . Since using Euclid distance for transportation cost and covering range is already unable to meet today’s hightime-sensitive customers, the consideration of real network situation is valuable.
In this research it primarily uses time as covering measurement. In this research, facilities location problems include maximal covering problem and set covering problem. Moreover, real map data was used to construct the network and an application was developed to verify the optimization model. The main methodology used here is the Lagrangean relaxation method. Two models were proposed in this research. One is the maximal covering location problem with time covering and multi planning period. It mainly discusses the specific number of facilities that try to cover maximal demand during planning periods. The other is the set covering location problem with time covering and multi planning period. It mainly discusses how to cover all demand with specific covering range to pursue minimizing total cost.
Additionally, the results obtained from this algorithm model were compared with the results gained from the optimization software –Lingo to verify the performance. Finally it concludes and gives some future research.
|
|---|
