Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
From MaRDI portal
Publication:1762137
DOI10.1016/j.cor.2011.08.018zbMath1251.90257OpenAlexW2061132775MaRDI QIDQ1762137
Kourosh Eshghi, S. M. H. Manzour-Al-Ajdad, S. Ali Torabi
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.018
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Integer linear programming models for grid-based light post location problem, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs, The location-allocation problem of drone base stations, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, A branch-and-price approach for the continuous multifacility monotone ordered median problem, A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A guided reactive GRASP for the capacitated multi-source Weber problem
- Planar expropriation problem with non-rigid rectangular facilities
- A perturbation-based heuristic for the capacitated multisource Weber problem
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Heuristic methods for large centroid clustering problems
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A cellular heuristic for the multisource Weber problem.
- A hierarchical algorithm for the planar single-facility location routing problem
- A simulated annealing methodology to distribution network design and management
- Lagrangean relaxation. (With comments and rejoinder).
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Simulated annealing heuristics for the dynamic facility layout problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- New heuristic methods for the capacitated multi-facility Weber problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Heuristic Methods for Location-Allocation Problems
- New assignment algorithms for the multi-depot vehicle routing problem
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- The Transportation-Location Problem
