A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem

DOI10.1016/j.cor.2023.106373OpenAlexW4385687895MaRDI QIDQ6068702

Zhouxing Su, Chu-Min Li, Zhipeng Lü, Qingyun Zhang

Publication date: 13 November 2023

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

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106373

zbMATH Keywords

location problemtabu search\(p\)-center problemvertex weightingsolution-based tabu strategy

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient local search heuristic with row weighting for the unicost set covering problem
• Double bound method for solving the \(p\)-center location problem
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• Designing a distribution network in a supply chain system: formulation and efficient solution procedure
• The \(p\)-median problem: a survey of metaheuristic approaches
• Clustering to minimize the maximum intercluster distance
• A scalable exact algorithm for the vertex \(p\)-center problem
• Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Dominant, an algorithm for the \(p\)-center problem.
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
• Network and Discrete Location: Models, Algorithms, and Applications, Second Edition
• A New Formulation and Resolution Method for the p-Center Problem
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Guided Local Search
• NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
• Integrating heuristic information into exact methods: The case of the vertex p-centre problem
• Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set
• The m-Center Problem
• The Location of Emergency Service Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph