A Memetic Algorithm for the Facility Location Problem

Favorite this paper
How to cite this paper?
  • Presentation type: Trabalho completo (oral)
  • Track: 14. OC – Otimização Combinatória
  • Keywords: Uncapacitated Facility Location Problem; Memetic Algorithms; Late Acceptance Algorithm;
  • 1 Universidade Federal de São Carlos
  • 2 Universidade Federal de Itajubá
  • 3 The University of Newcastle

A Memetic Algorithm for the Facility Location Problem

Renata Sarmet Smiderle Mendes

Universidade Federal de São Carlos


The Facility Location Problem seeks to decide how many and which facilities to open in order to serve the demands of a set of clients. It is a very relevant problem due to its theoretical interest, being an NP-hard problem widely studied, and for which numerous approximation algorithms and metaheuristics are proposed. It is also relevant for being motivated by practical applications, modeling problems such as plant positioning, construction of computer networks and information clustering.

In this work we present a memetic algorithm (MA) and a late acceptance algorithm for the uncapacitated facility location problem (UFLP). The computational experiments show that the MA achieves better solutions when compared with approximation algorithms and other metaheuristics.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!