Heuristic Methods for Location-Allocation Problems
From MaRDI portal
Publication:4527247
DOI10.1137/1006005zbMath0956.90014OpenAlexW2026589647WikidataQ124877771 ScholiaQ124877771MaRDI QIDQ4527247
Publication date: 11 March 2001
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1006005
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, Location-allocation on congested networks, A projection method for \(l_ p\) norm location-allocation problems, The planar multifacility collection depots location problem, 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, 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, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Heuristics for a continuous multi-facility location problem with demand regions, New heuristic algorithms for solving the planar \(p\)-median problem, The Weber obnoxious facility location model: a big arc small arc approach, 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, The effect of ignoring routes when locating depots, A perturbation-based heuristic for the capacitated multisource Weber problem, Continuous location of an assembly station, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, Biologically inspired parent selection in genetic algorithms, An efficient heuristic algorithm for the capacitated \(p\)-median problem, Clustering and the perturbed spatial median, The hub location and routing problem, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, A double annealing algorithm for discrete location/allocation problems, A two-echelon joint continuous-discrete location model, A voltage drop limited decentralized electric power distribution network, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, The blockwise coordinate descent method for integer programs, Covering models and optimization techniques for emergency response facility location and planning: a review, Prepositioning supplies in preparation for disasters, A guided reactive GRASP for the capacitated multi-source Weber problem, A comparative study of heuristics for a two-level routing-location problem, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, 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, Simultaneous berth allocation and yard planning at tactical level, Accelerating the convergence in the single-source and multi-source Weber problems, Heuristic approaches for solid transportation-\(p\)-facility location problem, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Solving a continuous local access network design problem with a stabilized central column generation approach, A cellular heuristic for the multisource Weber problem., A new bounding method for single facility location models, \(k\)-means genetic algorithms with greedy genetic operators, Self-organizing feature maps for solving location--allocation problems with rectilinear distances., An exact and a heuristic approach for the transportation-\(p\)-facility location problem, Hamiltonian location problems, An algorithm for generalized constrained multi-source Weber problem with demand substations, A two-phased approach to the supply network reconfiguration problem, 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, On the convergence of the Cooper's algorithm, Classical and inverse median location problems under uncertain environment, Sequential location of two facilities: comparing random to optimal location of the first facility, New local searches for solving the multi-source Weber problem, An optimal method for solving the (generalized) multi-Weber problem, Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane, 2-facility manifold location routing problem, The multi-facility location-allocation problem with polyhedral barriers, Spatial point process models for location-allocation problems, A new local search for continuous location problems, 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, Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning, A generalized Weiszfeld method for the multi-facility location problem, Generalized coverage: new developments in covering location models, A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand, A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem, The location-allocation problem of drone base stations, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria, Attraction probabilities in variable neighborhood search, Normative location theory: Placement in continuous space, Directional approach to gradual cover: the continuous case, 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, A continuous analysis framework for the solution of location-allocation problems with dense demand, 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, 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, Determining dominant wind directions, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, Simultaneous siting and sizing of distribution centers on a plane, The variable radius covering problem, Solving probabilistic multi-facility Weber problem by vector quantization, Approximation of solutions for location problems, A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach, Exact and heuristic solutions of the global supply chain problem with transfer pricing, An elliptical cover problem in drone delivery network design and its solution algorithms, A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, Kohonen maps for solving a class of location-allocation problems, Multi-facility green Weber problem, Heuristics for the capacitated plant location model, Heuristic solutions to multi-depot location-routing problems, The \(K\)-connection location problem in a plane, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem, LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, Un algorithme pour résoudre une famille de problèmes de localisation multisources, The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory, Location of a distribution center for a perishable product, Locating facilities in three‐dimensional space by convex programming, 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, Discrete facility location in machine learning, Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights, A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities, A directional approach to gradual cover, Location Science in Canada, A trajectory based heuristic for the planar \(p\)-median problem, Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach, Exact and approximate solutions to the multisource weber problem, A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification, Extensions to the planar \(p\)-median problem, Local convergence in Fermat's problem, 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, On solving unreliable planar location problems, On the collection depots location problem, On the Fermat—Weber problem with convex cost functions, A minisum location problem with regional demand considering farthest Euclidean distances, Improved starting solutions for the planar p-median problem, A historical perspective on location problems, Using injection points in reformulation local search for solving continuous location problems, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, Generating good starting solutions for the p-median problem in the plane, Median Problems in Networks, Continuous Center Problems, Heuristics for Location Models, A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
