Pages that link to "Item:Q856193"

The following pages link to An efficient solution method for Weber problems with barriers based on genetic algorithms (Q856193):

Displaying 26 items.

• An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
• The Weber problem in congested regions with entry and exit points (Q337649) (← links)
• A planar single facility location and border crossing problem (Q339663) (← links)
• A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
• On the use of the varignon frame for single facility Weber problems in the presence of convex barriers (Q439364) (← links)
• A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations (Q473730) (← links)
• Continuous location model of a rectangular barrier facility (Q526636) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
• Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993) (← links)
• Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
• The rectilinear distance Weber problem in the presence of a probabilistic line barrier (Q1038385) (← links)
• Generalization of the restricted planar location problems: unified metaheuristic algorithms (Q1654346) (← links)
• An algorithm for generalized constrained multi-source Weber problem with demand substations (Q1728411) (← links)
• Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
• Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← links)
• Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones (Q1930700) (← links)
• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs (Q1993202) (← links)
• Median location problem with two probabilistic line barriers: extending the Hooke and Jeeves algorithm (Q2165800) (← links)
• Single facility siting involving allocation decisions (Q2178111) (← links)
• Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
• Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem (Q2358289) (← links)
• A unified model for Weber problems with continuous and network distances (Q2384880) (← links)
• Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)
• Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier (Q2668733) (← links)
• Optimization of location of interconnected facilities on parallel lines with forbidden zones (Q5100137) (← links)