An effective heuristic for the \(P\)-median problem with application to ambulance location
From MaRDI portal
Publication:505139
DOI10.1007/s12597-012-0098-xzbMath1353.90179OpenAlexW2089727601WikidataQ58994629 ScholiaQ58994629MaRDI QIDQ505139
Publication date: 19 January 2017
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-012-0098-x
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
The reverse selective balance center location problem on trees ⋮ The complete vertex \(p\)-center problem ⋮ A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic programming heuristic for the \(P\)-median problem
- A double annealing algorithm for discrete location/allocation problems
- An efficient genetic algorithm for the \(p\)-median problem
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- A Procedure for Locating Emergency-Service Facilities for All Possible Response Distances
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Mathematical Programming and the Location of Fire Companies for the Denver Fire Department
- Solving an ambulance location model by tabu search
- Solution of a Large-Scale Traveling-Salesman Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The Location of Emergency Service Facilities
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Genetic clustering algorithms.
- Defining tabu list size and aspiration criterion within tabu search methods
This page was built for publication: An effective heuristic for the \(P\)-median problem with application to ambulance location
