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

0.00 Avg rating—0 Votes

Article ID:	iaor201527025
Volume:	62
Issue:	6
Start Page Number:	337
End Page Number:	349
Publication Date:	Oct 2015
Journal:	Computers and Operations Research
Authors:	Fernndez Jos, Redondo Juana L, Ortigosa Pilar M, Domingo lvarez Hervs Jos, Gila Arrondo Arnzazu
Keywords:	combinatorial optimization, programming: multiple criteria, design

Abstract:

A new multi‐objective evolutionary algorithm, called FEMOEA, is presented.

Its aim is to obtain a discrete approximation of the Pareto‐front of multi‐objective optimization problems.

It combines ideas from different multi‐objective and single‐objective optimization evolutionary algorithms.

It also incorporates a new improving method and a new stopping rule. It has been applied to a hard‐to‐solve bi‐objective continuous competitive facility location and design problem.

Computational studies show that the new method outperforms, on average, both SPEA2 and NSGA‐II.

Reviews

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