Abstract

In this paper a new evolutionary approach for solving the multi-level uncapacitated facility location problem (MLUFLP) is presented. Binary encoding scheme is used with appropriate objective function containing dynamic programming approach for finding sequence of located facilities on each level to satisfy clients' demands. The experiments were carried out on the modified standard single level facility location problem instances. Genetic algorithm (GA) reaches all known optimal solutions for smaller dimension instances, obtained by total enumeration and CPLEX solver. Moreover, all optimal/best known solutions were reached by genetic algorithm for a single-level variant of the problem.

Keywords

Cite this article

@article{cai-1829,
  author  = {Miroslav Marić},
  title   = {An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem},
  journal = {Computing and Informatics},
  volume  = {29},
  number  = {2},
  pages   = {183--201},
  year    = {2010},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2010/2/an-efficient-genetic-algorithm-for-solving-the-multi-level-uncapacitated-facility-location-problem/}
}
Download .bib