Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

DOI10.1007/S12597-020-00487-0OpenAlexW3096508893MaRDI QIDQ832797FDOQ832797

Authors: Kayhan Alamatsaz, Mehdi Iranpoor, S. M. T. Fatemi Ghomi 

Publication date: 25 March 2022

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-020-00487-0

Recommendations

• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
• Location of Multiple Obnoxious Facilities
• scientific article; zbMATH DE number 961966
• Review of obnoxious facilities location problems
• Models and algorithms of semi-obnoxious facility location problems

zbMATH Keywords

NSGA-IIminimal coveringbi-objective optimizationcase studyobnoxious facilityp-dispersion

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Introduction to algorithms.
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Title not available (Why is that?)
• The minimum weighted covering location problem with distance constraints
• Title not available (Why is that?)
• The obnoxious \(p\) facility network location problem with facility interaction
• On covering location problems on networks with edge demand
• Probabilistic single obnoxious facility location with fixed budget
• The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
• The maximin-maxisum network location problem
• A multiobjective model for locating undesirable facilities
• Undesirable facility location with minimal covering objectives
• Exact and heuristic approaches for the locational planning of an integrated solid waste management system
• Reverse 1-maxian problem with keeping existing 1-median
• A new compact formulation for the discrete \(p\)-dispersion problem
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
• A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation
• Locating a semi-obnoxious facility in the special case of Manhattan distances
• Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms
• Obnoxious Centers in Graphs
• Title not available (Why is that?)
• A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
• A parallel variable neighborhood search approach for the obnoxious p‐median problem

Cited In (1)

• Multiple obnoxious facility location: the case of protected areas

This page was built for publication: Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832797)