Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477820 | European Journal of Operational Research | 2007 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Haluk Yapicioglu, Alice E. Smith, Gerry Dozier,