An efficient solution method for Weber problems with barriers based on genetic algorithms
From MaRDI portal
Publication:856193
DOI10.1016/j.ejor.2005.10.061zbMath1111.90064OpenAlexW1971983956MaRDI QIDQ856193
Kathrin Klamroth, Martin Bischoff
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.061
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (27)
Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem ⋮ A unified model for Weber problems with continuous and network distances ⋮ The Weber problem in congested regions with entry and exit points ⋮ A planar single facility location and border crossing problem ⋮ Generalization of the restricted planar location problems: unified metaheuristic algorithms ⋮ Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm ⋮ Single facility siting involving allocation decisions ⋮ Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier ⋮ Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones ⋮ Optimization of location of interconnected facilities on parallel lines with forbidden zones ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ On the use of the varignon frame for single facility Weber problems in the presence of convex barriers ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Construction Line Algorithms for the Connection Location-Allocation Problem ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Continuous location model of a rectangular barrier facility ⋮ The multi-facility location-allocation problem with polyhedral barriers ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ Successive computation of some efficient locations of the Weber problem with barriers ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ Allocation search methods for a generalized class of location-allocation problems ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Solving the uncapacitated hub location problem using genetic algorithms
- On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- GBSSS: The generalized big square small square method for planar single- facility location
- An efficient algorithm for facility location in the presence of forbidden regions
- Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
- Algebraic properties of location problems with one circular barrier.
- Planar Weber location problems with barriers and block norms
- Planar weber location problems with line barriers
- A Bi-Objective Median Location Problem With a Line Barrier
- Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- The Minisum and Minimax Location Problems Revisited
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Dominating sets for rectilinear center location problems with polyhedral barriers
- On the Continuous Fermat-Weber Problem
- Farthest neighbors and center points in the presence of rectngular obstacles
- A reduction result for location problems with polyhedral barriers
- Supply facility and input/output point locations in the presence of barriers
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient solution method for Weber problems with barriers based on genetic algorithms
