Allocation search methods for a generalized class of location-allocation problems
From MaRDI portal
Publication:1011223
DOI10.1016/j.ejor.2007.10.022zbMath1157.90486OpenAlexW2026729118MaRDI QIDQ1011223
Kerstin Dächert, Martin Bischoff
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.022
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Construction Line Algorithms for the Connection Location-Allocation Problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- The \(K\)-connection location problem in a plane
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A projection method for \(l_ p\) norm location-allocation problems
- Variable neighborhood search
- Future paths for integer programming and links to artificial intelligence
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- On the Complexity of Some Common Geometric Location Problems
- Convergence and finite-time behavior of simulated annealing
- Location-Allocation Problems
- Properties and Solution Methods for Large Location-Allocation Problems
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Variable neighborhood search for the p-median
- Feature Article—Genetic Algorithms for the Operations Researcher
- Heuristic Methods for Location-Allocation Problems
- Equation of State Calculations by Fast Computing Machines
- Exact and approximate solutions to the multisource weber problem
- Handbook of metaheuristics
- On the use of genetic algorithms to solve location problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
