An efficient solution method for Weber problems with barriers based on genetic algorithms
From MaRDI portal
Publication:856193
DOI10.1016/J.EJOR.2005.10.061zbMATH Open1111.90064OpenAlexW1971983956MaRDI QIDQ856193FDOQ856193
Authors: 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
Recommendations
- Planar Weber location problems with barriers and block norms
- Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- scientific article; zbMATH DE number 1855792
- Planar weber location problems with line barriers
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Solving the uncapacitated hub location problem using genetic algorithms
- The Minisum and Minimax Location Problems Revisited
- Title not available (Why is that?)
- On the Continuous Fermat-Weber Problem
- GBSSS: The generalized big square small square method for planar single- facility location
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Planar weber location problems with line barriers
- 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
- 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
- Title not available (Why is that?)
- A reduction result for location problems with polyhedral barriers
- Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
- Algebraic properties of location problems with one circular barrier.
- A Bi-Objective Median Location Problem With a Line Barrier
- Planar Weber location problems with barriers and block norms
- Dominating sets for rectilinear center location problems with polyhedral barriers
- Supply facility and input/output point locations in the presence of barriers
- Farthest neighbors and center points in the presence of rectngular obstacles
- On the accuracy of demand point solutions to the planar, Manhattan metric, p-median problem, with and without barriers to travel
Cited In (32)
- Construction Line Algorithms for the Connection Location-Allocation Problem
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
- Optimization of location of interconnected facilities on parallel lines with forbidden zones
- Planar weber location problems with line barriers
- Planar Weber location problems with barriers and block norms
- A planar single facility location and border crossing problem
- Allocation search methods for a generalized class of location-allocation problems
- A projected Weiszfeld algorithm for the box-constrained Weber location problem
- Generalization of the restricted planar location problems: unified metaheuristic algorithms
- Rectilinear distance to a facility in the presence of a square barrier
- A guided reactive GRASP for the capacitated multi-source Weber problem
- Conditional facility location problems with continuous demand and a polygonal barrier
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- Successive computation of some efficient locations of the Weber problem with barriers
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers
- The multi-facility location-allocation problem with polyhedral barriers
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
- Single facility siting involving allocation decisions
- Title not available (Why is that?)
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
- The Weber problem in congested regions with entry and exit points
- Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm
- A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
- Continuous location model of a rectangular barrier facility
- Solving net-constrained clustering problem
- Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem
- Multiple obnoxious facility location: the case of protected areas
- A unified model for Weber problems with continuous and network distances
This page was built for publication: An efficient solution method for Weber problems with barriers based on genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856193)
