Back to Search
Start Over
An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- Source :
- Journal of Global Optimization. 76:793-818
- Publication Year :
- 2019
- Publisher :
- Springer Science and Business Media LLC, 2019.
-
Abstract
- Multi-source Weber problem (MSWP) is a classical nonconvex and NP-hard model in facility location. A well-known method for solving MSWP is the location–allocation algorithm which consists of a location phase to locate new facilities and an allocation phase to allocate customers at each iteration. This paper considers the more general and practical case of MSWP called the constrained multi-source Weber problem (CMSWP), i.e., locating multiple facilities with the consideration of the gauge for measuring distances and locational constraints on new facilities. According to the favorable structure of the involved location subproblems after reformulation, an alternating direction method of multipliers (ADMM) type method is contributed to solving these subproblems under different distance measures in a uniform framework. Then a new ADMM-based location–allocation algorithm is presented for CMSWP and its local convergence is theoretically proved. Some preliminary numerical results are reported to verify the effectiveness of proposed methods.
- Subjects :
- 021103 operations research
Control and Optimization
Applied Mathematics
0211 other engineering and technologies
Structure (category theory)
02 engineering and technology
Weber problem
Management Science and Operations Research
Gauge (firearms)
Distance measures
Facility location problem
Computer Science Applications
Local convergence
Location-allocation
Algorithm
Multi-source
Mathematics
Subjects
Details
- ISSN :
- 15732916 and 09255001
- Volume :
- 76
- Database :
- OpenAIRE
- Journal :
- Journal of Global Optimization
- Accession number :
- edsair.doi...........0479a84ca37cd143287ba9f5394dba2a