Treffer: Locating multiple facilities using the max-sum objective.

Highlights • Two New obnoxious facilities location models are proposed. • Special solution procedures proposed for their solution. • SNOPT and interior point in Matlab tested as well. • The solution procedure performed significantly better than Matlab. Abstract We propose to apply a multi-start sequential linear programming (MSLP) algorithm for the solution of two multiple obnoxious facility problems on the plane. One problem (Max-Sum1) considers obnoxious facilities and the other (Max-Sum2) obnoxious demand points. The Max-Sum1 objective is maximizing the total distance between demand points and their closest facility. For Max-Sum2 the objective is maximizing the total distance between facilities and their closest demand point. The MSLP algorithm is compared with the interior point and SNOPT solvers in Matlab. A heuristic procedure based on Voronoi diagrams is proposed for the solution of Max-Sum2. The interior point solver performed quite poorly. The solutions by MSLP are of better quality (but not significantly better) than SNOPT for Max-Sum1. For Max-Sum2 the heuristic approach performed best (and significantly better). The MSLP algorithm performed significantly better than SNOPT. [ABSTRACT FROM AUTHOR]

Copyright of Computers & Industrial Engineering is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)