Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A generalized Weiszfeld method for the multi-facility location problem
Date
2010-05-01
Author
İyigün, Cem
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
195
views
0
downloads
Cite This
An iterative method is proposed for the K facilities location problem. The problem is relaxed using probabilistic assignments, depending on the distances to the facilities. The probabilities, that decompose the problem into K single-facility location problems, are updated at each iteration together with the facility locations. The proposed method is a natural generalization of the Weiszfeld method to several facilities.
Subject Keywords
Fermat-Weber location problem
,
Multi-facility location problem
,
Decomposition method
,
Probabilistic assignments
,
Weiszfeld method
URI
https://hdl.handle.net/11511/43210
Journal
OPERATIONS RESEARCH LETTERS
DOI
https://doi.org/10.1016/j.orl.2009.11.005
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
An interactive solution approach for a bi-objective semi-desirable location problem
Karasakal, Esra (Springer Science and Business Media LLC, 2008-10-01)
In this study, we consider a semi-desirable facility location problem in a continuous planar region considering the interaction between the facility and the existing demand points. A facility can be defined as semi-desirable if it has both undesirable and desirable effects to the people living in the vicinity. Our aim is to maximize the weighted distance of the facility from the closest demand point as well as to minimize the service cost of the facility. The distance between the facility and the demand poi...
A minisum location problem with regional demand considering farthest Euclidean distances
DİNLER, DERYA; Tural, Mustafa Kemal (2016-06-01)
We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed convex) polygonal and/or circular demand regions, and facilities they are assigned to. We show that the single facility version of the problem has a straightforward second-order cone programming formulation and can therefore be efficiently solved to optimality. To solve large size instances, we adapt a multi-dimensional direct search descent algorithm to ...
A maximal covering location model in the presence of partial coverage
Karasakal, O; Karasakal, Esra (2004-08-01)
The maximal covering location problem (MCLP) addresses the issue of locating a predefined number of facilities in order to maximize the number of demand points that can be covered. In a classical sense, a demand point is assumed to be covered completely if located within the critical distance of the facility and not covered at all outside of the critical distance. Since the optimal solution to a MCLP is likely sensitive to the choice of the critical distance, determining a critical distance value when the c...
The Weber problem in congested regions with entry and exit points
Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2015-10-01)
The Weber problem is about finding a facility location on a plane such that the total weighted distance to a set of given demand points is minimized. The facility location and access routes to the facility can be restricted if the Weber problem contains congested regions, some arbitrary shaped polygonal areas on the plane, where location of a facility is forbidden and traveling is allowed at an additional fixed cost. Traveling through congested regions may also be limited to certain entry and exit points (o...
A genetic algorithm for the uncapacitated single allocation planar hub location problem
Damgacioglu, Haluk; DİNLER, DERYA; Özdemirel, Nur Evin; İyigün, Cem (2015-10-01)
Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each s...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. İyigün, “A generalized Weiszfeld method for the multi-facility location problem,”
OPERATIONS RESEARCH LETTERS
, pp. 207–214, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43210.