On heuristic bi-criterion methods for semi-obnoxious facility location

P.M. Ortigosa, E.M.T. Hendrix, J.L. Rendondo

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

Abstract

Locating a semi-obnoxious facility, like an airport or correctional center is typically a bi-criterion problem combining a convex objective function representing minimum transportation cost with a multi-extremal objective function representing the non-desirable part of the facility. Generic one or bi-objective heuristic methods can be applied to generate efficient locations for the problem. We consider the location of one facility in the plane and show that a simple random or grid search with filtering already provides a very good picture of the trade-off between the two objectives. Moreover, we argue that instead of using bi-criterion meta-heuristics, one could better exploit the convex–nonconvex structure of the problem applying the constraint method. We show how to evaluate the methods systematically using several heuristics from literature.
LanguageEnglish
Pages205-217
JournalComputational Optimization and Applications
Volume61
DOIs
Publication statusPublished - 2015

Fingerprint

Obnoxious Facilities
Bicriteria
Facility Location
Heuristics
Objective function
Extremal Function
Heuristic methods
Heuristic Method
Airports
Metaheuristics
Convex function
Filtering
Trade-offs
Grid
Evaluate
Costs

Keywords

  • multiobjective optimization
  • global optimization
  • desirable facility
  • search
  • model

Cite this

@article{7215e24d87d14e6cac7c1c7ce2b097e1,
title = "On heuristic bi-criterion methods for semi-obnoxious facility location",
abstract = "Locating a semi-obnoxious facility, like an airport or correctional center is typically a bi-criterion problem combining a convex objective function representing minimum transportation cost with a multi-extremal objective function representing the non-desirable part of the facility. Generic one or bi-objective heuristic methods can be applied to generate efficient locations for the problem. We consider the location of one facility in the plane and show that a simple random or grid search with filtering already provides a very good picture of the trade-off between the two objectives. Moreover, we argue that instead of using bi-criterion meta-heuristics, one could better exploit the convex–nonconvex structure of the problem applying the constraint method. We show how to evaluate the methods systematically using several heuristics from literature.",
keywords = "multiobjective optimization, global optimization, desirable facility, search, model",
author = "P.M. Ortigosa and E.M.T. Hendrix and J.L. Rendondo",
year = "2015",
doi = "10.1007/s10589-014-9709-1",
language = "English",
volume = "61",
pages = "205--217",
journal = "Computational Optimization and Applications",
issn = "0926-6003",
publisher = "Springer Verlag",

}

On heuristic bi-criterion methods for semi-obnoxious facility location. / Ortigosa, P.M.; Hendrix, E.M.T.; Rendondo, J.L.

In: Computational Optimization and Applications, Vol. 61, 2015, p. 205-217.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - On heuristic bi-criterion methods for semi-obnoxious facility location

AU - Ortigosa, P.M.

AU - Hendrix, E.M.T.

AU - Rendondo, J.L.

PY - 2015

Y1 - 2015

N2 - Locating a semi-obnoxious facility, like an airport or correctional center is typically a bi-criterion problem combining a convex objective function representing minimum transportation cost with a multi-extremal objective function representing the non-desirable part of the facility. Generic one or bi-objective heuristic methods can be applied to generate efficient locations for the problem. We consider the location of one facility in the plane and show that a simple random or grid search with filtering already provides a very good picture of the trade-off between the two objectives. Moreover, we argue that instead of using bi-criterion meta-heuristics, one could better exploit the convex–nonconvex structure of the problem applying the constraint method. We show how to evaluate the methods systematically using several heuristics from literature.

AB - Locating a semi-obnoxious facility, like an airport or correctional center is typically a bi-criterion problem combining a convex objective function representing minimum transportation cost with a multi-extremal objective function representing the non-desirable part of the facility. Generic one or bi-objective heuristic methods can be applied to generate efficient locations for the problem. We consider the location of one facility in the plane and show that a simple random or grid search with filtering already provides a very good picture of the trade-off between the two objectives. Moreover, we argue that instead of using bi-criterion meta-heuristics, one could better exploit the convex–nonconvex structure of the problem applying the constraint method. We show how to evaluate the methods systematically using several heuristics from literature.

KW - multiobjective optimization

KW - global optimization

KW - desirable facility

KW - search

KW - model

U2 - 10.1007/s10589-014-9709-1

DO - 10.1007/s10589-014-9709-1

M3 - Article

VL - 61

SP - 205

EP - 217

JO - Computational Optimization and Applications

T2 - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

ER -