Communications - Scientific Letters of the University of Zilina 1999, 1(2):4-8 | DOI: 10.26552/com.C.1999.2.4-8

Comparing dual access approaches for exact solution of location problems

Jaroslav Janacek1, Johanna Kovacikova1
1 Department of Transportation Networks, Faculty of Management Science and Informatics, University of Žilina, Slovak Republic

The paper deals with exact solution of two uncapacitated location problems. The location problem consists in placing some facilities of unrestricted capacity in the formed network. The facility can have various natures. It could be aservice centre, whose location can be done at anode of the network, or it can be adirect train, which can be placed into a transport plan. In comparison with the former case, this facility has the nature of a graph edge.The key-stone of the computational success of the often used branch and bound method is the lower bound tightness. This paper, reports numerical experiments with the dual access approach used for the solution of the node location problem in a large network and compares several possible approaches to lower bound enumeration for the edge location problem.

Keywords: no keywords

Published: June 30, 1999  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Janacek, J., & Kovacikova, J. (1999). Comparing dual access approaches for exact solution of location problems. Communications - Scientific Letters of the University of Zilina, 1(2), 4-8. doi: 10.26552/com.C.1999.2.4-8
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. BALAKRISHNAN, A., MAGNANTI, T., L., WONG, R., T.: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design. Ops. Res., Vol. 37, No. 5, Sept-Oct 1989, pp. 716-740 Go to original source...
    2. CENEK, P.: Metody optimálního výběru kombinace středisek obsluhy. Práce a štúdie VŠDS, Séria kybernetická, Vol. 1, Alfa, Bratislava, 1982, pp. 61-74
    3. ERLENKOTTER, D.: A Dual-Based Procedure for Uncapacitated Facility Location. Operations Research, Vol 26, No 6, November-December 1978, pp. 992-1009 Go to original source...
    4. JANÁČEK J., KOVAČIKOVÁ J.: Exact Solution Techniques for Large Location Problems. In: Proceedings of the Mathematical Methods in Economics, Ostrava, Sept. 9-11, 1997, pp. 80-84
    5. JÁNOŠÍKOVÁ, L.: An Adaptation of the Tabu search Metaheuristic to the Problem of Transportation Planning. In: Proceedings of Transportation Systems, IFAC/IFIP/IFORS, Chania, Greece, 16.-18. June 1997, pp. 765-768
    6. KUBANOVÁ, J., ČAPEK, J., LINDA, B.: Problem of Location of Recycling Centres. In: Proceedings of the Mathematical Methods in Economics,, Ostrava, Sept. 9-11, 1997, pp. 111-113
    7. REEVES, C., R.: Modern Heuristic Techniques for Combinatorial Problems. Oxford Blackwell Scientific Publications, 1993, 320 p.

    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