Heuristic solution of the multisource Weber problem as a \(p\)-median problem
From MaRDI portal
Publication:1271380
DOI10.1016/S0167-6377(98)00004-2zbMath0911.90240OpenAlexW1993450447MaRDI QIDQ1271380
Pierre Hansen, Nenad Mladenović, Éric D. Taillard
Publication date: 15 November 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00004-2
Related Items
A fast algorithm for the rectilinear distance location problem, The planar multifacility collection depots location problem, Logistics distribution centers location problem and algorithm under fuzzy environment, 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, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, 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, An agent-based framework for modeling and solving location problems, The optimal solution set of the multi-source Weber problem, A voltage drop limited decentralized electric power distribution network, A guided reactive GRASP for the capacitated multi-source Weber problem, Location Science in Canada, A trajectory based heuristic for the planar \(p\)-median problem, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion, Solving a minisum single facility location problem in three regions with different norms, A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification, Extensions to the planar \(p\)-median problem, A cellular heuristic for the multisource Weber problem., On the Weber facility location problem with limited distances and side constraints, On the convergence of the Cooper's algorithm, Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows, New local searches for solving the multi-source Weber problem, A fuzzy algorithm for continuous capacitated location allocation model with risk consideration, Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs, On solving unreliable planar location problems, A new local search for continuous location problems, Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem, Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm, Facility location models for distribution system design, The location-allocation problem of drone base stations, Attraction probabilities in variable neighborhood search, Region-rejection based heuristics for the capacitated multi-source Weber problem, Transport clustering and routing as a visual meshing process, 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, Improved starting solutions for the planar p-median problem, Using injection points in reformulation local search for solving continuous location problems, An elliptical cover problem in drone delivery network design and its solution algorithms, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, Heuristics for Location Models, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Variable neighborhood search for minimum sum-of-squares clustering on networks, A continuous location-allocation problem with zone-dependent fixed cost, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of two dual-based procedures for solving the p-median problem
- An optimal method for solving the (generalized) multi-Weber problem
- A projection method for \(l_ p\) norm location-allocation problems
- A new adaptive multi-start technique for combinatorial global optimizations
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- On the Complexity of Some Common Geometric Location Problems
- A quadratically convergent method for minimizing a sum of euclidean norms
- Location-Allocation Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Heuristic Methods for Location-Allocation Problems
- Exact and approximate solutions to the multisource weber problem
