![Solving the semi-desirable facility location problem using bi-objective particle swarm [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PB/bigB000PBZXRY.jpg)
Solving the semi-desirable facility location problem using bi-objective particle swarm [An article from: European Journal of Operational Research]
Price not available for India
You can still browse on Amazon. Try another country above.
Book Details
Author(s)
H. Yapicioglu, A.E. Smith, G. Dozier
Publisher
Elsevier
ISBN / ASIN
B000PBZXRY
ISBN-13
978B000PBZXR2
Marketplace
India 🇮🇳
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
