Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 177, Issue 2, Pages 733-749Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2005.11.020
Keywords
multiple criteria analysis; semi-obnoxious; location; evolutionary computation; bi-objective PSO
Ask authors/readers for more resources
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. (c) 2006 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available