Heuristics for a continuous multi-facility location problem with demand regions

DOI10.1016/J.COR.2014.09.001zbMATH Open1348.90431OpenAlexW2038354247MaRDI QIDQ337660FDOQ337660

Authors Derya Dinler, Mustafa Kemal Tural, Cem Iyigun

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://etd.lib.metu.edu.tr/upload/12616644/index.pdf

zbMATH Keywords

second order cone programmingfacility location problemshyperbolic smoothingminimum sum of squares clustering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)

Recommendations

• A minisum location problem with regional demand considering farthest Euclidean distances
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
• Location of regional facilities
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons

Cites work

• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 3286662 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• A heuristic method for large-scale multi-facility location problems
• Applications of second-order cone programming
• Generalized Weber Problem with Rectangular Regions
• Heuristic Methods for Location-Allocation Problems
• Locating facilities by minimax relative to closest points of demand areas
• Location Models With Groups Of Demand Points
• Minisum location problem with farthest Euclidean distances
• Minisum location with closest Euclidean distances
• Numbers and functions. From a classical-experimental mathematician's point of view
• On the Complexity of Some Common Geometric Location Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Second-order cone programming
• Solving semidefinite-quadratic-linear programs using SDPT3
• The Weber problem with regional demand
• The generalized Weber problem with expected distances
• The hyperbolic smoothing clustering method
• The p-center location problem in an area

Cited in

(8)

• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
• Constructive heuristics for the uncapacitated continuous location-allocation problem
• Location of regional facilities
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
• A minisum location problem with regional demand considering farthest Euclidean distances
• A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
• Facility location problems on graphs with non-convex neighborhoods

Describes a project that uses

Uses Software

• SDPT3
• CPLEX
• Gurobi
• CVX

This page was built for publication: Heuristics for a continuous multi-facility location problem with demand regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337660)