A generalized model of equality measures in network location problems

A generalized model of equality measures in network location problems

0.00 Avg rating0 Votes
Article ID: iaor2009848
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 651
End Page Number: 660
Publication Date: Mar 2008
Journal: Computers and Operations Research
Authors: , ,
Keywords: combinatorial analysis
Abstract:

In this paper, the concept of the ordered weighted averaging operator is applied to define a model which unifies and generalizes several inequality measures. For a location x, the value of the new objective function is the ordered weighted average of the absolute deviations from the average distance from the facilities to the location x. Several kinds of networks are studied: cyclic, tree and path networks and, for each of them, the properties of the objective function are analyzed in order to identify a finite dominating set for optimal locations. Polynomial-time algorithms are proposed for these problems, and the corresponding complexity is discussed.

Reviews

Required fields are marked *. Your email address will not be published.