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

DOI10.1016/j.cor.2014.09.001zbMath1348.90431OpenAlexW2038354247MaRDI QIDQ337660

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

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

Related Items (5)

Facility location problems on graphs with non-convex neighborhoods ⋮ A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes ⋮ An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ A minisum location problem with regional demand considering farthest Euclidean distances

Uses Software

• SDPT3
• CPLEX
• Gurobi
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• Minisum location problem with farthest Euclidean distances
• Applications of second-order cone programming
• The Weber problem with regional demand
• Second-order cone programming
• A heuristic method for large-scale multi-facility location problems
• Minisum location with closest Euclidean distances
• The hyperbolic smoothing clustering method
• On the Complexity of Some Common Geometric Location Problems
• Generalized Weber Problem with Rectangular Regions
• The p-center location problem in an area
• Heuristic Methods for Location-Allocation Problems
• The generalized Weber problem with expected distances
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Location Models With Groups Of Demand Points
• Locating facilities by minimax relative to closest points of demand areas

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