A D.C. biobjective location model

  • Authors:

  • Rafael Blanquero;Emilio Carrizosa

  • Affiliations:

  • Departamento de Estadí/stica e Investigació/n Operativa, Facultad de Matemá/ticas, Universidad de Sevilla, C/. Tarfia S.N., 41012 Sevilla, Spain Fax: +34-954622800/ (e-mail: rb ...;Departamento de Estadí/stica e Investigació/n Operativa, Facultad de Matemá/ticas, Universidad de Sevilla, C/. Tarfia S.N., 41012 Sevilla, Spain Fax: +34-954622800/ (e-mail: ec ...

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we address the biobjective problem of locating a semiobnoxious facility, that must provide service to a given set of demand points and, at the same time, has some negative effect on given regions in the plane. In the model considered, the location of the new facility is selected in such a way that it gives answer to these contradicting aims: minimize the service cost (given by a quite general function of the distances to the demand points) and maximize the distance to the nearest affected region, in order to reduce the negative impact. Instead of addressing the problem following the traditional trend in the literature (i.e., by aggregation of the two objectives into a single one), we will focus our attention in the construction of a finite ϵ-dominating set, that is, a finite feasible subset that approximates the Pareto-optimal outcome for the biobjective problem. This approach involves the resolution of univariate d.c. optimization problems, for each of which we show that a d.c. decomposition of its objective can be obtained, allowing us to use standard d.c. optimization techniques.