EconPapers    
Economics at your fingertips  
 

Optimal location with equitable loads

Oded Berman, Zvi Drezner (), Arie Tamir and George Wesolowsky
Additional contact information
Zvi Drezner: http://business.fullerton.edu/isds/zdrezner

Annals of Operations Research, 2009, vol. 167, issue 1, 307-325

Abstract: The problem considered in this paper is to find p locations for p facilities such that the weights attracted to each facility will be as close as possible to one another. We model this problem as minimizing the maximum among all the total weights attracted to the various facilities. We propose solution procedures for the problem on a network, and for the special cases of the problem on a tree or on a path. The complexity of the problem is analyzed, O(n) algorithms and an O(pn 3 ) dynamic programming algorithm are proposed for the problem on a path respectively for p=2 and p>2 facilities. Heuristic algorithms (two types of a steepest descent approach and tabu search) are proposed for its solution. Extensive computational results are presented. Copyright Springer Science+Business Media, LLC 2009

Keywords: Equitable loads; Facility location; Network (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0339-9 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:167:y:2009:i:1:p:307-325:10.1007/s10479-008-0339-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-008-0339-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

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

 
Page updated 2025-03-20
Handle: RePEc:spr:annopr:v:167:y:2009:i:1:p:307-325:10.1007/s10479-008-0339-9