Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem

Computers & Operations Research, Volume 62, Issue C, 2015.

Cited by: 14|Bibtex|Views19|Links
EI

Abstract:

A bi-objective competitive facility location and design problem is considered. The problem of obtaining a complete representation of the efficient set and its corresponding Pareto-front has been previously tackled through exact general methods, but they require high computational effort. In this work, we propose a new evolutionary multi-o...More

Code:

Data:

Your rating :
0

 

Tags
Comments