Local search algorithm for universal facility location problem with linear penalties

Yicheng Xu (), Dachuan Xu (), Donglei Du () and Chenchen Wu ()
Additional contact information
Yicheng Xu: Beijing University of Technology
Dachuan Xu: Beijing University of Technology
Donglei Du: University of New Brunswick
Chenchen Wu: Tianjin University of Technology

Journal of Global Optimization, 2017, vol. 67, issue 1, No 17, 367-378

Abstract: Abstract The universal facility location problem generalizes several classical facility location problems, such as the uncapacitated facility location problem and the capacitated location problem (both hard and soft capacities). In the universal facility location problem, we are given a set of demand points and a set of facilities. We wish to assign the demands to facilities such that the total service as well as facility cost is minimized. The service cost is proportional to the distance that each unit of the demand has to travel to its assigned facility. The open cost of facility i depends on the amount z of demand assigned to i and is given by a cost function $$f_i(z)$$ f i ( z ) . In this work, we extend the universal facility location problem to include linear penalties, where we pay certain penalty cost whenever we refuse serving some demand points. As our main contribution, we present a ( $$7.88+\epsilon $$ 7.88 + ϵ )-approximation local search algorithm for this problem.

Keywords: Approximation algorithm; Universal facility location problem; Linear penalty; Local search (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-015-0394-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jglopt:v:67:y:2017:i:1:d:10.1007_s10898-015-0394-0

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-015-0394-0

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().