Solving the semi-desirable facility location problem using bi-objective particle swarm
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.
location semi-obnoxious bi-objective pso multiple criteria analysis evolutionary computation