Efficient Heuristics For Facility Location Problem With Foresight

Efficient Heuristics For Facility Location Problem With Foresight

倪琨珉(TEDDY)

指導教授 ： 吳建文

國立臺北科技大學/管理學院/管理國際學生碩士專班 (IMBA)/碩士(2014年)

https://doi.org/10.6841/NTUT.2014.00357

摘要

Researchers have been solving location problems with the assumption that the competition in the market does not subject the new facilities that is located in the market. Meanwhile, competitive facility location model is the awareness that a firm’s location may affect its market share. The facilities capture as many customers as possible in order to maximize the market share. On the other hand, no existing facilities exist in the area where p-center problems apply. The objective in p-center is to minimize the cost for customer.

The consideration in this research is customers patronize the nearest facility, whereas distance is the attractiveness. Therefore, we could propose an idea to implement the p-center into competitive location problem model in order to satisfy the assumption. Tabu search is one algorithm that has been applied to location problems successfully. In addition to the contributions mentioned earlier, we could also utilize efficient heuristics for facility location with foresight.

關鍵字

market capture ； von Stackelberg ； p-center ； competitive location problem ； tabu search ； cplex

並列摘要

Researchers have been solving location problems with the assumption that the competition in the market does not subject the new facilities that is located in the market. Meanwhile, competitive facility location model is the awareness that a firm’s location may affect its market share. The facilities capture as many customers as possible in order to maximize the market share. On the other hand, no existing facilities exist in the area where p-center problems apply. The objective in p-center is to minimize the cost for customer.

The consideration in this research is customers patronize the nearest facility, whereas distance is the attractiveness. Therefore, we could propose an idea to implement the p-center into competitive location problem model in order to satisfy the assumption. Tabu search is one algorithm that has been applied to location problems successfully. In addition to the contributions mentioned earlier, we could also utilize efficient heuristics for facility location with foresight.

並列關鍵字

market capture ； von Stackelberg ； p-center ； competitive location problem ； tabu search ； cplex

參考文獻

Al-Sultan, K. S., & Al-Fawzan, M. A. (1999). A tabu search approach to the uncapacitated facility location problem. Annuals of Operations Research, 86, 91-103.

Berman, O., & Huang, R. (2008). The minimum weighted covering location problem with distance constraints. Computer & Operations Research, 35, 356-372.

Berman, O., & Simchi-Levi, D. (1990). Conditional location problems on networks. Transportation Science, 24, 77-78.

Bilgin, S., & Azizoğlu, M. (2009). Operation assignment and capacity allocation problem in automated manufacturing systems. Computers & Industrial Engineering, 56, 662-676.

Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3), 268-308.