Communications - Scientific Letters of the University of Zilina 2005, 7(2):9-12 | DOI: 10.26552/com.C.2005.2.9-12

The Exact and Near Optimal Solution of the Competitive Uncapacitated Location Problem

Lubos Buzna1
1 Faculty of Management Science and Informatics, University of Zilina, Slovakia

This paper is dedicated to the recent unprecedented boom of new supermarkets and hypermarkets in middle Europe. The motivation is to provide for the newcomers the tool for decision support, and to help answer the questions: "Is still economically advantageous to build new shopping malls and where to locate them?" We introduce the four versions of data correcting algorithm and three heuristics: simple exchange heuristic, exchange heuristics enhanced by simulated annealing metaheuristic, and genetic algorithm. All these methods were examined at the benchmarks of practical nature. This research showed the data correcting method as useable for practical instances of this problem. There were also identified interesting dependencies between the computational time and the number of competitors.

Keywords: no keywords

Published: June 30, 2005  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Buzna, L. (2005). The Exact and Near Optimal Solution of the Competitive Uncapacitated Location Problem. Communications - Scientific Letters of the University of Zilina, 7(2), 9-12. doi: 10.26552/com.C.2005.2.9-12
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. BEDNÁR, P.: Interactive system for cargo train routing. In proceedings of the international symposium for PhD students and young researchers, Perner's Contact 2002, Pardubice 5. - 6. February 2002, p. 11
    2. BENATI, S.: An improved branch & bound method for the uncapacitated competitive location problem. Annals of Operations Research 122, 2003, p. 43-58 Go to original source...
    3. CENEK, P., JÁNO©ÍKOVÁ, Ą.: Transportation service model for regions. Horizonty dopravy, No. 1, 2000, p. 10-12
    4. GOLDENGORIN, B., TJISSEN, J., GHOSH, D., SIERKSMA, G.: Solving the simple plant location problem using a data correcting approach. Journal of Global Optimization 25, 2003, p. 377-406 Go to original source...
    5. KRATICA, J., TO©IC, D., FILIPOVIČ, V., LJUBIĆ, I.: Solving the plant location problem by genetic algorithm. RAIRO Operations Research 35, 2001, p. 127-142. Go to original source...

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content