Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Heuristics for a continuous multi-facility location problem with demand regions
Date
2015-10
Author
Dinler, Derya
Tural, Mustafa Kemal
İyigün, Cem
Metadata
Show full item record
Item Usage Stats
4
views
0
downloads
We propose mathematical programming formulations of the single and multiple facility versions of the problem considered. The single facility location problem is formulated as a second order cone programming (SOCP) problem, and hence is solvable in polynomial time. The multiple facility location problem is NP-hard in general and can be formulated as a mixed integer SOCP problem. This formulation is weak and does not even solve medium-size instances. To solve larger instances of the problem we propose three heuristics. When all the demand regions are rectangular regions with their sides parallel to the standard coordinate axes, a faster special heuristic is developed. We compare our heuristics in terms of both solution quality and computational time.
Subject Keywords
Facility location problems
,
Second order cone programming
,
Minimum sum of squares clustering
,
Hyperbolic smoothing
URI
https://hdl.handle.net/11511/28541
Journal
Computers & Operations Research
DOI
https://doi.org/10.1016/j.cor.2014.09.001
Collections
Department of Industrial Engineering, Article