A parallel variable neighborhood search for -neighbor facility location problems

DOI10.1016/J.COR.2024.106589MaRDI QIDQ6561237FDOQ6561237

Luiz Antonio Nogueira Lorena, Jacques Renaud, Guilherme O. Chagas, Leandro C. Coelho, Rafael D. C. dos Santos

Publication date: 25 June 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

\(\alpha\)-neighbor \(p\)-center\(\alpha\)-neighbor \(p\)-medianbasic VNSLIMAparallel VNS

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A note on solving large p-median problems
• TSPLIB—A Traveling Salesman Problem Library
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Title not available (Why is that?)
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Title not available (Why is that?)
• The backup 2‐center and backup 2‐median problems on trees
• The \(p\)-median problem: a survey of metaheuristic approaches
• Variable neighborhood search
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Fault tolerant \(K\)-center problems
• Solution methods for thep-median problem: An annotated bibliography
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The \(p\)-neighbor \(k\)-center problem
• Variable neighborhood search for the p-median
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• An improved simulated annealing algorithm for bandwidth minimization
• An effective VNS for the capacitated \(p\)-median problem
• Location Science
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• A scalable exact algorithm for the vertex \(p\)-center problem
• Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• The probabilistic \(p\)-center problem: planning service for potential customers
• GRASP and VNS for solving the \(p\)-next center problem
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
• GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
• Variable neighborhood search: the power of change and simplicity

This page was built for publication: A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems

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