File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand

TitleA Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
Authors
KeywordsBarzilai-Borwein gradient method
Weiszfeld procedure
Regional demand
Farthest distance
Facility location
Issue Date2012
Citation
Computational Optimization and Applications, 2012, v. 51, n. 3, p. 1275-1295 How to Cite?
AbstractWe 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 Identifierhttp://hdl.handle.net/10722/250992
ISSN
2023 Impact Factor: 1.6
2023 SCImago Journal Rankings: 1.322
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorJiang, Jianlin-
dc.contributor.authorYuan, Xiaoming-
dc.date.accessioned2018-02-01T01:54:16Z-
dc.date.available2018-02-01T01:54:16Z-
dc.date.issued2012-
dc.identifier.citationComputational Optimization and Applications, 2012, v. 51, n. 3, p. 1275-1295-
dc.identifier.issn0926-6003-
dc.identifier.urihttp://hdl.handle.net/10722/250992-
dc.description.abstractWe 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.languageeng-
dc.relation.ispartofComputational Optimization and Applications-
dc.subjectBarzilai-Borwein gradient method-
dc.subjectWeiszfeld procedure-
dc.subjectRegional demand-
dc.subjectFarthest distance-
dc.subjectFacility location-
dc.titleA Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s10589-010-9392-9-
dc.identifier.scopuseid_2-s2.0-84862009226-
dc.identifier.volume51-
dc.identifier.issue3-
dc.identifier.spage1275-
dc.identifier.epage1295-
dc.identifier.eissn1573-2894-
dc.identifier.isiWOS:000301181200016-
dc.identifier.issnl0926-6003-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats