New heuristic algorithms for solving the planar \(p\)-median problem
From MaRDI portal
Publication:337669
DOI10.1016/j.cor.2014.05.010zbMath1348.90388OpenAlexW2054920135MaRDI QIDQ337669
Jack Brimberg, Said Salhi, Nenad Mladenović, Zvi Drezner
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)
Related Items
The planar multifacility collection depots location problem, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Biologically inspired parent selection in genetic algorithms, A voltage drop limited decentralized electric power distribution network, 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, Location Problems with Cutoff, Integrated optimization model for distribution network design: a case study of the clothing industry, The blockwise coordinate descent method for integer programs, A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification, Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems, \(k\)-means genetic algorithms with greedy genetic operators, An exact column-generation approach for the lot-type design problem, Classical and inverse median location problems under uncertain environment, A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms, Improved starting solutions for the planar p-median problem, An elliptical cover problem in drone delivery network design and its solution algorithms, Multi-facility green Weber problem
Uses Software
Cites Work
- Unnamed Item
- A new heuristic for solving the \(p\)-median problem in the plane
- New local searches for solving the multi-source Weber problem
- The big cube small cube solution method for multidimensional facility location problems
- Improving worst-case behavior of heaps
- A distance based rule for removing population members in genetic algorithms
- General variable neighborhood search for the continuous optimization
- 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
- Degeneracy in the multi-source Weber problem
- A projection method for \(l_ p\) norm location-allocation problems
- Variable neighborhood search
- Heuristic methods for large centroid clustering problems
- An efficient genetic algorithm for the \(p\)-median problem
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Gaussian variable neighborhood search for continuous optimization
- A new local search for continuous location problems
- 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
- On the Complexity of Some Common Geometric Location Problems
- Location-Allocation Problems
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- The Facility Location Problem with Limited Distances
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- Heuristic Methods for Location-Allocation Problems
- Using hybrid metaheuristics for the one-way and two-way network design problem
- Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes
- Decomposition strategies for large-scale continuous location–allocation problems
- Gender-Specific Genetic Algorithms*
