Relevant Network Distances for Approximate Approach to Large p-Median Problems

Jaroslav Janacek () and Marek Kvet ()
Additional contact information
Jaroslav Janacek: University of Zilina
Marek Kvet: University of Zilina

A chapter in Operations Research Proceedings 2012, 2014, pp 123-128 from Springer

Abstract: Abstract This paper deals with the approximate approach to the large p-median problems based on the set-covering formulation. This approach pays for its shorter computational time or smaller demanded memory by losing its accuracy. The accuracy can be improved by more suitable determination of the dividing points which are used for the distance approximation. This contribution suggests that some network distances from the customers to the possible service center locations can be considered relevant, and are expected to belong to the optimal solution. We proposed to formalize the outlined notion of relevance, and based the dividing point selection on it. Hereby, we are studying the impact of the dividing point determination on the effectiveness of the presented approximate approach.

Keywords: Facility Location; Large Instance; Network Distance; Approximate Approach; Optimization Software (search for similar items in EconPapers)
Date: 2014
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-00795-3_18

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

DOI: 10.1007/978-3-319-00795-3_18

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 ().