The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory

DOI10.1016/j.ejor.2014.10.006zbMath1339.90204OpenAlexW2061349834MaRDI QIDQ2629705

Gábor Nagy, Abdalla Elshaikh, Said Salhi

Publication date: 6 July 2016

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

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

zbMATH Keywords

continuous space\(p\)-centre problemadaptive searchelzinga-hearn algorithmvariable neighbourhood search with memory

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Drezner's exact method for the continuous \(p\)-centre problem revisited ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Variable neighborhood search
• Solution methodologies for the smallest enclosing circle problem
• A computational approach for eliminating error in the solution of the location set covering problem
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• A Note on p-Center Problems in the Plane
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Heuristic Methods for Location-Allocation Problems
• Integrating heuristic information into exact methods: The case of the vertex p-centre problem
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• Solving the continuous space p-centre problem: planning application issues

This page was built for publication: The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory