An improved algorithm for solving the Weber location problem

Zvi Drezner ()
Additional contact information
Zvi Drezner: California State University-Fullerton

4OR, 2025, vol. 23, issue 1, No 2, 53-63

Abstract: Abstract In this note we propose an improved algorithm for the solution of the Weber problem which is the most fundamental problem in location analysis. It is used as a building block in many algorithms for solving more complicated location problems. The algorithm is very simple to implement and the idea behind it can inspire solution approaches to other optimization problems as well. Computational experiments demonstrated the superior performance of the proposed algorithm. Such an improvement will assist in the solution of more complicated models that apply the solution to Weber problem repeatedly many times as part of their solution algorithms.

Keywords: Location analysis; Weber problem; Solution algorithm; Non-linear programming (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10288-024-00565-9 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:aqjoor:v:23:y:2025:i:1:d:10.1007_s10288-024-00565-9

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

DOI: 10.1007/s10288-024-00565-9

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().