An Algorithm for 4-Median Problem with Obnoxious Facilities In Trees.

• Main Authors: Fang, Yachun, 枋雅純
• Other Authors: Yeh, Dinghung
• Format: Others
• Language: en_US
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/05560237022944771900

碩士 === 國立中正大學 === 企業管理研究所 === 100 === We investigate the location problems which began in the early 1900 when Weber considered how to locate a single warehouse so as to minimize the total distance between it and customers. Since the mid-1960s, the study of location theory has flourished. The p-center and p-median problems are probably the most widely studied problems. In recent years, there has been an interest in obnoxious facility location problems where one or more facilities are to be placed as far away as possible from the customers. This paper deals with facility location problems with negative weights in trees, and we consider model which is one of objective functions to handle obnoxious facilities: minimize the sum of the weighted minimum distances of the vertices of the facilities to demand. In this paper we show that for the case an optimal solution for the second model in trees and an illustrative example is given to show the effectiveness of the model.