An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem

Ľuboš Buzna (), Michal Koháni and Jaroslav Janáček
Additional contact information
Ľuboš Buzna: University of Zilina
Michal Koháni: University of Zilina
Jaroslav Janáček: University of Zilina

A chapter in Operations Research Proceedings 2014, 2016, pp 71-76 from Springer

Abstract: Abstract We propose a new approximative approach to the discrete facility location problem that provides solutions close to the lexicographic minimax optimum. The lexicographic minimax optimum is concept that allows to find equitable location of facilities. Our main contribution is the approximation approach, which is based on the rules allowing: (i) to take into account the multiplicities assigned to different customers; (ii) to detect whether for a given distance active customers can reach higher, equal or smaller distance to the closest located facility; and (iii) to use methods customized for solving the p-median problem. Customized methods can handle larger problems than state-of-the-art general purpose integer programming solvers. We use the resulting algorithm to perform extensive study using the well-known benchmarks and benchmarks derived from the real-world road network data. We demonstrate that our algorithm allows to solve larger problems than existing algorithms and provides high-quality solutions. The algorithm found the optimal solution for all tested benchmarks, where we could compare the results with the exact algorithm.

Keywords: Discrete Facility Location Problems; Equitable Location; Lexicographic Minimax; Similar Combinatorial Optimization Problems; Proposed Estimation Approach (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_11

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().