A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem

DOI10.1007/S11590-020-01690-0MaRDI QIDQ2070130zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

facility location problemmulti-objective optimizationobnoxious p-median problemvariable neighborhood search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• The parallel variable neighborhood search for the \(p\)-median problem
• Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
• scientific article; zbMATH DE number 6961910
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems
• Variable neighborhood search for the p-median

Cites work

• Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
• Capacitated facility location problem with general setup cost
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
• 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
• The discrete facility location problem with balanced allocation of customers
• The parallel variable neighborhood search for the \(p\)-median problem
• Variable neighborhood search
• Variable neighborhood search: basics and variants

Cited in

(13)

• A bi-objective approach to discrete cost-bottleneck location problems
• Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
• Alternative formulations for the obnoxious \(p\)-median problem
• The obnoxious facilities planar \(p\)-median problem
• Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
• scientific article; zbMATH DE number 6961910 (Why is no real title available?)
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• Variable neighborhood search: the power of change and simplicity
• A matheuristic for locating obnoxious facilities
• An exact method for the bi-objective p-median max-sum diversity problem
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
• A branch-and-cut method for the obnoxious \(p\)-median problem

Describes a project that uses

Uses Software

• SPEA2
• irace
• jMetal

This page was built for publication: A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem

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