GRASP with strategic oscillation for the -neighbor p-center problem

DOI10.1016/J.EJOR.2022.02.038MaRDI QIDQ2673563zbMATH OpenOpenAlexWikidataFDO

Authors Jesús Sánchez-Oro, Ana D. López-Sánchez, Abraham Duarte, Alfredo G. Hernández-Díaz

Publication date 10 June 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2022.02.038

zbMATH Keywords

\(p\)-center problemGRASPmetaheuristicsstrategic oscillationtabu search

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The complete vertex \(p\)-center problem
• GRASP and VNS for solving the \(p\)-next center problem
• Dominant, an algorithm for the \(p\)-center problem.

Cites work

• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A perturbation heuristic for a class of location problems
• A probabilistic heuristic for a computationally difficult set covering problem
• An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
• An annotated bibliography of GRASP – Part I: Algorithms
• An annotated bibliography of GRASP-Part II: Applications
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Fault tolerant \(K\)-center problems
• GRASP and VNS for solving the \(p\)-next center problem
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• Metaheuristic applications on discrete facility location problems: a survey
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The m-Center Problem
• The p-neighbor k-center problem
• TTT plots: a perl program to create time-to-target plots
• When centers can fail: a close second opportunity

Cited in

(6)

• GRASP and VNS for solving the \(p\)-next center problem
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
• Exact solution approaches for the discrete α‐neighbor p‐center problem
• A parallel variable neighborhood search for -neighbor facility location problems

Describes a project that uses

Uses Software

• Tabu search
• TTTPLOTS
• GRASP
• PERL

This page was built for publication: GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem

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