CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Sensitivity Analysis of a Genetic Algorithm for a Competitive Facility Location Problem Export

Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering (2008), pp. 266-271.

Citation Format

[Posts]

View FullText article


Optimization's tags for this article

continuous evolutionary-computation genetic-algorithm multi-objective parameter-setting performance-assessment

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

The 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.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.