![]() |
CiteULike | ![]() |
Group: Optimization | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Sensitivity Analysis of a Genetic Algorithm for a Competitive Facility Location ProblemInnovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering (2008), pp. 266-271.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe paper describes an application of a multi-objective evolutionary algorithm that finds Pareto-optimal solutions to a competitive facility location problem and reports a sensitivity analysis of the evolutionary algorithm model. A genetic algorithm which uses non-uniform mutation and continuous recombination is developed to find solutions to the bi-objective location problem. Results show that the genetic algorithm can find solutions close to the Pareto-optimal set in polynomial time and results from sensitivity analysis show that the mutation rate has the largest influence on the output among the input factors.
BibTeX record
RIS record