New heuristic algorithms for solving the planar p-median problem
From MaRDI portal
Publication:337669
DOI10.1016/J.COR.2014.05.010zbMATH Open1348.90388OpenAlexW2054920135MaRDI QIDQ337669FDOQ337669
Jack Brimberg, Said Salhi, Zvi Drezner, Nenad Mladenović
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.010
genetic algorithmvariable neighborhood searchlocation analysismulti-source Weber problemplanar \(p\)-median
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- An efficient genetic algorithm for the \(p\)-median problem
- A projection method for \(l_ p\) norm location-allocation problems
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Using hybrid metaheuristics for the one-way and two-way network design problem
- Decomposition strategies for large-scale continuous location–allocation problems
- Variable neighborhood search
- On the Complexity of Some Common Geometric Location Problems
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- GBSSS: The generalized big square small square method for planar single- facility location
- A new heuristic for solving the \(p\)-median problem in the plane
- The big cube small cube solution method for multidimensional facility location problems
- Variable neighborhood search for the p-median
- A new local search for continuous location problems
- General variable neighborhood search for the continuous optimization
- Degeneracy in the multi-source Weber problem
- Heuristic methods for large centroid clustering problems
- Gaussian variable neighborhood search for continuous optimization
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Generating good starting solutions for the \(p\)-median problem in the plane
- A new genetic algorithm for the quadratic assignment problem
- Title not available (Why is that?)
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- The Facility Location Problem with Limited Distances
- New local searches for solving the multi-source Weber problem
- Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes
- Gender-Specific Genetic Algorithms*
- Improving worst-case behavior of heaps
- A distance based rule for removing population members in genetic algorithms
Cited In (24)
- Classical and inverse median location problems under uncertain environment
- \(k\)-means genetic algorithms with greedy genetic operators
- Multi-facility green Weber problem
- Improved starting solutions for the planar p-median problem
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights
- A hybrid heuristic for the \(p\)-median problem
- Integrated optimization model for distribution network design: a case study of the clothing industry
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- An alternating heuristic for medianoid and centroid problems in the plane
- Biologically inspired parent selection in genetic algorithms
- Title not available (Why is that?)
- Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
- Location Problems with Cutoff
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- A voltage drop limited decentralized electric power distribution network
- The blockwise coordinate descent method for integer programs
- An elliptical cover problem in drone delivery network design and its solution algorithms
- A new heuristic approach for the P-median problem
- An efficient genetic algorithm for the \(p\)-median problem
- An exact column-generation approach for the lot-type design problem
- The planar multifacility collection depots location problem
Uses Software
This page was built for publication: New heuristic algorithms for solving the planar \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337669)
