Heuristic Methods for Location-Allocation Problems
From MaRDI portal
Publication:4527247
Recommendations
Cited in
(only showing first 100 items - show all)- Region-rejection based heuristics for the capacitated multi-source Weber problem
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- Allocation search methods for a generalized class of location-allocation problems
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Simultaneous siting and sizing of distribution centers on a plane
- The variable radius covering problem
- Solving probabilistic multi-facility Weber problem by vector quantization
- Exact and heuristic solutions of the global supply chain problem with transfer pricing
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Heuristics for the capacitated plant location model
- Location-allocation on congested networks
- The effect of ignoring routes when locating depots
- A comparative study of heuristics for a two-level routing-location problem
- Optimal location on a sphere
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- Hamiltonian location problems
- An optimal method for solving the (generalized) multi-Weber problem
- Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
- Normative location theory: Placement in continuous space
- Determining dominant wind directions
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Kohonen maps for solving a class of location-allocation problems
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- A projection method for \(l_ p\) norm location-allocation problems
- Location, scheduling, design and integer programming
- The hub location and routing problem
- A double annealing algorithm for discrete location/allocation problems
- A cellular heuristic for the multisource Weber problem.
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Heuristic solutions to multi-depot location-routing problems
- The planar multifacility collection depots location problem
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- The Weber obnoxious facility location model: a big arc small arc approach
- A two-echelon joint continuous-discrete location model
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
- Optimization of competitive facility location for chain stores
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- A hierarchical algorithm for the planar single-facility location routing problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- A heuristic method for large-scale multi-facility location problems
- Approximation of solutions for location problems
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Simultaneous berth allocation and yard planning at tactical level
- A two-phased approach to the supply network reconfiguration problem
- Classical and inverse median location problems under uncertain environment
- Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
- Directional approach to gradual cover: the continuous case
- An elliptical cover problem in drone delivery network design and its solution algorithms
- A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods
- A two-level off-grid electric distribution problem on the continuous space
- Biologically inspired parent selection in genetic algorithms
- A voltage drop limited decentralized electric power distribution network
- The blockwise coordinate descent method for integer programs
- Heuristic approaches for solid transportation-\(p\)-facility location problem
- \(k\)-means genetic algorithms with greedy genetic operators
- An exact and a heuristic approach for the transportation-\(p\)-facility location problem
- On the convergence of the Cooper's algorithm
- A new local search for continuous location problems
- The location-allocation problem of drone base stations
- A new heuristic for the linear placement problem
- Solving multiple facilities location problems with separated clusters
- Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- Multi-facility green Weber problem
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- A bibliography for some fundamental problem categories in discrete location science
- Regional service coverage modeling
- On strategies to fix degenerate \(k\)-means solutions
- The optimal solution set of the multi-source Weber problem
- A directional approach to gradual cover
- The planar hub location problem: a probabilistic clustering approach
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- Location of a distribution center for a perishable product
- A minisum location problem with regional demand considering farthest Euclidean distances
- On statistical bounds of heuristic solutions to location problems
- Generating good starting solutions for the \(p\)-median problem in the plane
- An application of the great deluge algorithm in planar location problems
- scientific article; zbMATH DE number 3856820 (Why is no real title available?)
- scientific article; zbMATH DE number 3867057 (Why is no real title available?)
- Heuristic cluster algorithm for multiple facility location-allocation problem
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- Location equilibria for a continuous competitive facility location problem under delivered pricing
- Heuristics for a continuous multi-facility location problem with demand regions
- New heuristic algorithms for solving the planar p-median problem
- Improved starting solutions for the planar p-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- Comparing Exact and Heuristic Methods for Site Location Based on Multiple Attributes: An Afforestation Application
- Continuous location of an assembly station
This page was built for publication: Heuristic Methods for Location-Allocation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527247)
