<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf25306</article-id><article-id pub-id-type="doi">10.15388/Informatica.2014.23</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Memetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Marić</surname><given-names>Miroslav</given-names></name><email xlink:href="mailto:maricm@matf.bg.ac.rs">maricm@matf.bg.ac.rs</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Stanimirović</surname><given-names>Zorica</given-names></name><email xlink:href="mailto:zoricast@matf.bg.ac.rs">zoricast@matf.bg.ac.rs</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/><xref ref-type="corresp" rid="fn1">∗</xref></contrib><contrib contrib-type="Author"><name><surname>Djenić</surname><given-names>Aleksandar</given-names></name><email xlink:href="mailto:djenic@matf.bg.ac.rs">djenic@matf.bg.ac.rs</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><contrib contrib-type="Author"><name><surname>Stanojević</surname><given-names>Predrag</given-names></name><email xlink:href="mailto:djapedjape@gmail.com">djapedjape@gmail.com</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Faculty of Mathematics, University of Belgrade, Studentski trg 16/IV, 11 000 Belgrade, Serbia</aff></contrib-group><author-notes><corresp id="fn1"><label>∗</label>Corresponding author.</corresp></author-notes><pub-date pub-type="epub"><day>01</day><month>01</month><year>2014</year></pub-date><volume>25</volume><issue>3</issue><fpage>439</fpage><lpage>466</lpage><history><date date-type="received"><day>01</day><month>08</month><year>2012</year></date><date date-type="accepted"><day>01</day><month>03</month><year>2014</year></date></history><abstract><p>We consider the Multilevel Uncapacitated Facility Location Problem (MLUFLP) and propose a new efficient integer programming formulation of the problem that provides optimal solutions for the MLUFLP test instances unsolved to optimality up to now. Further, we design a parallel Memetic Algorithm (MA) with a new strategy for applying the local search improvement within the MA frame. The conducted computational experiments show that the proposed MA quickly reaches all known optimal and best known solutions from the literature and additionally improves several solutions for large-scale MLUFLP test problems.</p></abstract><kwd-group><label>Keywords</label><kwd>facility location</kwd><kwd>network design</kwd><kwd>hierarchical problems</kwd><kwd>memetic algorithm</kwd><kwd>parallelization</kwd></kwd-group></article-meta></front></article>