The Maximin-Maxisum Network Location Problem |
| |
Authors: | Frank Guangsheng Zhang and Emanuel Melachrinoudis |
| |
Affiliation: | (1) Clearing and Settlement Systems, Instinet Corporation, 850 Third Avenue, New York, NY 10022, USA;(2) Department of Mechanical, Industrial, and Manufacturing Engineering, Northeastern University, Boston, Massachusetts 02115, USA |
| |
Abstract: | In this paper, we consider the problem of finding a point on a general network using two objectives, maximizing the minimum weighted distance from the point to the vertices (Maximin) and maximizing the sum of weighted distances between the point and the vertices (Maxisum). This bicriterion model can be used to locate an obnoxious facility on a network. We will identify the model properties, develop a polynomial algorithm for generating the efficient set and provide a numerical example. |
| |
Keywords: | network location multiple criteria maxisum maximin |
本文献已被 SpringerLink 等数据库收录! |
|