File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10589-010-9392-9
- Scopus: eid_2-s2.0-84862009226
- WOS: WOS:000301181200016
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
Title | A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand |
---|---|
Authors | |
Keywords | Barzilai-Borwein gradient method Weiszfeld procedure Regional demand Farthest distance Facility location |
Issue Date | 2012 |
Citation | Computational Optimization and Applications, 2012, v. 51, n. 3, p. 1275-1295 How to Cite? |
Abstract | We are interested in locations of multiple facilities in the plane with the aim of minimizing the sum of weighted distance between these facilities and regional customers, where the distance between a facility and a regional customer is evaluated by the farthest distance from this facility to the demand region. By applying the well-known location-allocation heuristic, the main task for solving such a problem turns out to solve a number of constrained Weber problems (CWPs). This paper focuses on the computational contribution in this topic by developing a variant of the classical Barzilai-Borwein (BB) gradient method to solve the reduced CWPs. Consequently, a hybrid Cooper type method is developed to solve the problem under consideration. Preliminary numerical results are reported to verify the evident effectiveness of the new method. © Springer Science+Business Media, LLC 2011. |
Persistent Identifier | http://hdl.handle.net/10722/250992 |
ISSN | 2023 Impact Factor: 1.6 2023 SCImago Journal Rankings: 1.322 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jiang, Jianlin | - |
dc.contributor.author | Yuan, Xiaoming | - |
dc.date.accessioned | 2018-02-01T01:54:16Z | - |
dc.date.available | 2018-02-01T01:54:16Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Computational Optimization and Applications, 2012, v. 51, n. 3, p. 1275-1295 | - |
dc.identifier.issn | 0926-6003 | - |
dc.identifier.uri | http://hdl.handle.net/10722/250992 | - |
dc.description.abstract | We are interested in locations of multiple facilities in the plane with the aim of minimizing the sum of weighted distance between these facilities and regional customers, where the distance between a facility and a regional customer is evaluated by the farthest distance from this facility to the demand region. By applying the well-known location-allocation heuristic, the main task for solving such a problem turns out to solve a number of constrained Weber problems (CWPs). This paper focuses on the computational contribution in this topic by developing a variant of the classical Barzilai-Borwein (BB) gradient method to solve the reduced CWPs. Consequently, a hybrid Cooper type method is developed to solve the problem under consideration. Preliminary numerical results are reported to verify the evident effectiveness of the new method. © Springer Science+Business Media, LLC 2011. | - |
dc.language | eng | - |
dc.relation.ispartof | Computational Optimization and Applications | - |
dc.subject | Barzilai-Borwein gradient method | - |
dc.subject | Weiszfeld procedure | - |
dc.subject | Regional demand | - |
dc.subject | Farthest distance | - |
dc.subject | Facility location | - |
dc.title | A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s10589-010-9392-9 | - |
dc.identifier.scopus | eid_2-s2.0-84862009226 | - |
dc.identifier.volume | 51 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 1275 | - |
dc.identifier.epage | 1295 | - |
dc.identifier.eissn | 1573-2894 | - |
dc.identifier.isi | WOS:000301181200016 | - |
dc.identifier.issnl | 0926-6003 | - |