Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
From MaRDI portal
Recommendations
- New heuristic methods for the capacitated multi-facility Weber problem
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
- A perturbation-based heuristic for the capacitated multisource Weber problem
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Region-rejection based heuristics for the capacitated multi-source Weber problem
Cites work
- scientific article; zbMATH DE number 5282971 (Why is no real title available?)
- scientific article; zbMATH DE number 5501651 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1461256 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A cellular heuristic for the multisource Weber problem.
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A hierarchical algorithm for the planar single-facility location routing problem
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- A simulated annealing methodology to distribution network design and management
- An optimal method for solving the (generalized) multi-Weber problem
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Heuristic Methods for Location-Allocation Problems
- Heuristic methods for large centroid clustering problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Lagrangean relaxation. (With comments and rejoinder).
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- New assignment algorithms for the multi-depot vehicle routing problem
- New heuristic methods for the capacitated multi-facility Weber problem
- Optimization by simulated annealing
- Planar expropriation problem with non-rigid rectangular facilities
- Simulated annealing heuristics for the dynamic facility layout problem
- The Transportation-Location Problem
Cited in
(16)- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
- Multi-facility green Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs
- A variational inequality heuristic algorithm for a constrained multi-source location-allocation model
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- Integer linear programming models for grid-based light post location problem
- scientific article; zbMATH DE number 5282971 (Why is no real title available?)
- Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- The location-allocation problem of drone base stations
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
This page was built for publication: Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762137)
