Solving the semi-desirable facility location problem using bi-objective particle swarm

Solving the semi-desirable facility location problem using bi-objective particle swarm

0.00 Avg rating0 Votes
Article ID: iaor20084289
Country: Netherlands
Volume: 177
Issue: 2
Start Page Number: 733
End Page Number: 749
Publication Date: Mar 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: decision theory: multiple criteria, heuristics: genetic algorithms
Abstract:

In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation costs and a distance-based piecewise function to represent the obnoxious effects of the facility. A single-objective particle swarm optimizer (PSO) and a bi-objective PSO are devised to solve the problem. Results are compared on a suite of test problems and show that the bi-objective PSO produces a diverse set of non-dominated solutions more efficiently than the single-objective PSO and is competitive with the best results from the literature. Computational complexity analysis estimates only a linear increase in effort with problem size.

Reviews

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