Multiple obnoxious facilities with weighted demand points

Pawel Kalczynski, Atsuo Suzuki and Zvi Drezner

Journal of the Operational Research Society, 2022, vol. 73, issue 3, 598-607

Abstract: In this paper we define and heuristically solve the multiple weighted obnoxious facilities location problem maximizing the minimum weighted distance between facilities and a given set of communities. Each community may have a different weight because different communities may be affected differently by a facility. The distance between pairs of facilities must exceed a given minimum distance. Solving the problem by the multi-purpose non-linear solver SNOPT from random starting locations performed poorly. Three approaches are proposed to generate “good” starting solutions. The best known solutions were established by these approaches.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2020.1851149 (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:taf:tjorxx:v:73:y:2022:i:3:p:598-607

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2020.1851149

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().