An efficient solution method for Weber problems with barriers based on genetic algorithms

No abstract is available for this paper.

• Publication year

  2007

• Venue

  European Journal of Operational Research

• Publication date

  2007-02-16

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.ejor.2005.10.061
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Single-facility location problems with barriers

  2010cited by this paper
• Solving the uncapacitated hub location problem using genetic algorithms

  2005cited by this paper
• Algebraic properties of location problems with one circular barrier

  2004cited by this paper
• Commentary on facility location in the presence of congested regions with the rectilinear distance metric

  2004cited by this paper
• Locating a 1-Center on a Manhattan Plane with “Arbitrarily” Shaped Barriers

  2003cited by this paper
• A global optimal approach to facility location in the presence of forbidden regions

  2003cited by this paper
• On the Continuous Fermat-Weber Problem

  2003cited by this paper
• A Bi-Objective Median Location ProblemWith a Line Barrier

  2002cited by this paper
• Supply facility and input/output point locations in the presence of barriers

  2002cited by this paper
• Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel

  2002cited by this paper
• Dominating sets for rectilinear center location problems with polyhedral barriers

  2002cited by this paper
• Planar weber location problems with line barriers

  2001cited by this paper
• A reduction result for location problems with polyhedral barriers

  2001cited by this paper
• Farthest neighbors and center points in the presence of rectngular obstacles

  2001cited by this paper
• Planar Weber location problems with barriers and block norms

  2000cited by this paper
• Planar Location Problems with Barriers under Polyhedral Gauges

  1999cited by this paper
• Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles

  1998cited by this paper
• Facility location in the presence of congested regions with the rectilinear distance metric

  1997cited by this paper
• An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals

  1997cited by this paper
• An efficient algorithm for facility location in the presence of forbidden regions

  1996cited by this paper
• Global Optimization in Location

  1995cited by this paper
• Restricted planar location problems and applications

  1995cited by this paper
• Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel

  1994cited by this paper
• Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence

  1992influential reference
• GBSSS: The generalized big square small square method for planar single-facility location

  1992cited by this paper
• Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions

  1989cited by this paper
• On the accuracy of demand point solutions to the planar, manhattan metric, p-median problem, with and without barriers to travel

  1988influential reference
• The Minisum and Minimax Location Problems Revisited

  1985cited by this paper
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel

  1983cited by this paper
• Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle

  1981influential reference

• The obnoxious facilities p-center problem with forbidden regions

  2026cites this paper
• Global Optimization Algorithm for the Multi-Weber Problem with Polyhedral Barriers

  2025cites this paper
• Multiple obnoxious facility location: the case of protected areas

  2024cites this paper
• Multiplant Location Involving Resource Allocation

  2023cites this paper
• An Optimized Discrete Data Classification Method in <math xmlns="http://www.w3.org/1998/Math/MathML" id="M1"> <mi>N</mi> </math>-Dimensional

  2022cites this paper
• An Optimized Discrete Data Classification Method in N -Dimensional

  2022cites this paper
• Adaptation of WO to the Euclidean location-allocation with unknown number of facilities

  2022cites this paper
• Computational Optimized Monitoring Methodology to Avoid Crowd Crush Accidents with Scattered Data

  2022cites this paper
• Capacitated Multi-Facility Location Problem on the Ellipsoid with Multi-Zone Restrictions

  2022cites this paper
• Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier

  2021cites this paper
• Optimization of the Location of Interconnected Facilities on Parallel Lines with Forbidden Zones

  2021cites this paper
• Median location problem with two probabilistic line barriers: Extending the Hook and Jeeves algorithm

  2021cites this paper
• Research minimax and minisum Weber problems on a plane with forbidden zones

  2021cites this paper
• Numerical research of placement problem on lines with forbidden zones and routing communications

  2021cites this paper
• Conditional facility location problems with continuous demand and a polygonal barrier

  2021cites this paper
• Single facility siting involving allocation decisions

  2020cites this paper
• Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier

  2020cites this paper
• Navigating concave regions in continuous facility location problems

  2020cites this paper
• Models and methods for One-Dimensional Space Allocation Problem with forbidden zones

  2020cites this paper
• Multi—facility placement on lines with forbidden zones and routing of communications

  2020cites this paper
• Equitable location of facilities in a region with probabilistic barriers to travel

  2019cites this paper
• A Novel UAV-Aided Network Architecture Using Wi-Fi Direct

  2019cites this paper
• Multicommodity flows and Benders decomposition for restricted continuous location problems

  2018influential citation
• Generalization of the restricted planar location problems: Unified metaheuristic algorithms

  2018cites this paper
• An algorithm for generalized constrained multi-source Weber problem with demand substations

  2018cites this paper
• A Distance Measuring Algorithm for Location Analysis

  2018cites this paper
• Branch and Bound Method for the Weber Problem with Rectangular Facilities on Lines in the Presence of Forbidden Gaps

  2018cites this paper
• The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methods

  2017cites this paper
• Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs

  2017cites this paper
• An algorithm for generalized constrained multi-source Weber problem with demand substations

  2017cites this paper
• Discretization Based Heuristics for the Capacitated Multi-facility Weber Problem with Convex Polyhedral Barriers

  2017influential citation
• Continuous location model of a rectangular barrier facility

  2017cites this paper
• Hybrid self-adaptive-velocity particle swarm optimisation-Cooper heuristic for the facility location allocation problem in Jakarta

  2016cites this paper
• A modelling framework for solving restricted planar location problems using phi-objects

  2016influential citation
• Weber problem for rectangles on lines with forbidden gaps

  2016cites this paper
• Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem

  2016cites this paper
• A rectilinear distance location–relocation problem with a probabilistic restriction: mathematical modelling and solution approaches

  2016cites this paper
• Spatial Filtering for Identifying a Shortest Path Around Obstacles

  2016cites this paper
• Continuous location model of a rectangular barrier facility

  2016cites this paper
• The Weber problem in congested regions with entry and exit points

  2015cites this paper
• Applying metaheuristic approaches on the single facility location problem with polygonal barriers

  2014cites this paper
• Two meta-heuristics for a multi-period minisum location–relocation problem with line restriction

  2014cites this paper
• Successive computation of some efficient locations of the Weber problem with barriers

  2013cites this paper
• A Capacitated Location-Allocation Model for Flood Disaster Service Operations with Border Crossing Passages and Probabilistic Demand Locations

  2013influential citation
• A new mathematical model for the Weber location problem with a probabilistic polyhedral barrier

  2013cites this paper
• An efficient method for single-facility location and path-connecting problems in a cell map

  2013cites this paper
• Two meta-heuristics for a multi-period minisum location–relocation problem with line restriction

  2013influential citation
• Probabilistic Formulation for Emergency Facility Location in a Divided Area

  2013cites this paper
• The center location-dependent relocation problem with a probabilistic line barrier

  2013cites this paper
• New heuristic methods for the single-source capacitated multi facility Weber problem

  2013cites this paper
• Efficient measurement of continuous space shortest distance around barriers

  2013cites this paper
• New heuristic methods for the single-source capacitated multi facility Weber problem

  2013cites this paper
• Multi-facility location problems in the presence of a probabilistic line barrier: a mixed integer quadratic programming model

  2012cites this paper
• Search region contraction of the weber problem solution on the plane with rectangular forbidden zones

  2012cites this paper
• A Weiszfeld-like algorithm for a Weber location problem constrained to a closed and convex set

  2012cites this paper
• On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers

  2012influential citation
• A planar single facility location and border crossing problem

  2012influential citation
• Rectilinear distance to a facility in the presence of a square barrier

  2012cites this paper
• A Multi-Period 1-Center Location Problem in the Presence of a Probabilistic Line Barrier

  2012cites this paper
• Rectilinear distance to a facility in the presence of a square barrier

  2012cites this paper
• Search region contraction of the weber problem solution on the plane with rectangular forbidden zones

  2012cites this paper
• Successive computation of some efficient locations of the Weber problem with barriers

  2012influential citation
• A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier

  2012influential citation
• An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem

  2011cites this paper
• The Capacitated Location-Allocation Problem in the Presence of k Connections

  2011influential citation
• Ant colony optimization algorithm for the Euclidean location-allocation problem with unknown number of facilities

  2011cites this paper
• A projected Weiszfeld algorithm for the box-constrained Weber location problem

  2011cites this paper
• The center location problem with equal weights in the presence of a probabilistic line barrier

  2011cites this paper
• A guided reactive GRASP for the capacitated multi-source Weber problem

  2011cites this paper
• A multi-period facility location-relocation problem in the presence of a probabilistic line barrier

  2011cites this paper
• A nonlinear programming model for a multi-facility location problem with a probabilistic line barrier

  2010cites this paper
• New Formulations and Approaches to Facility Location Problems in the Presence of Barriers

  2010cites this paper
• An exact solution of location of a circle to a set of the weighted points

  2010cites this paper
• The rectilinear distance Weber problem in the presence of a probabilistic line barrier

  2010cites this paper
• Region-rejection based heuristics for the capacitated multi-source Weber problem

  2009influential citation
• Allocation search methods for a generalized class of location-allocation problems

  2009cites this paper
• The multi-facility location-allocation problem with polyhedral barriers

  2009cites this paper
• A unified model for Weber problems with continuous and network distances

  2008cites this paper
• A GOAL PROGRAMMING MODEL FOR MULTIOBJECTIVE FACILITY LOCATION PROBLEMS IN A COMPETITIVE ENVIRONMENT

  2007cites this paper