A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
DOI10.1007/s11590-020-01690-0zbMath1483.90157OpenAlexW3118465879MaRDI QIDQ2070130
Jesús Sánchez-Oro, Ana D. López-Sánchez, J. Manuel Colmenar
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01690-0
multi-objective optimizationvariable neighborhood searchfacility location problemobnoxious p-median problem
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- The discrete facility location problem with balanced allocation of customers
- Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- Greedy randomized adaptive search procedures
- The parallel variable neighborhood search for the \(p\)-median problem
- Capacitated facility location problem with general setup cost
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Evolutionary Algorithms for Solving Multi-Objective Problems
This page was built for publication: A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
