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
Hierarchical maximal covering location problem with referral in the presence of partial coverage
Download
index.pdf
Date
2007
Author
Töreyen, Özgün
Metadata
Show full item record
Item Usage Stats
224
views
132
downloads
Cite This
We consider a hierarchical maximal covering location problem to locate p health centers and q hospitals in such a way that maximum demand is covered, where health centers and hospitals have successively inclusive hierarchy. Demands are 3 types: demand requiring low-level service only, demand requiring high-level service only, and demand requiring both levels of service at the same time. All types of requirements of a demand point should be either covered by hospital providing both levels of service or referred to hospital via health center since a demand point is not covered unless all levels of requirements are satisfied. Thus, a health center cannot be opened unless it is suitable to refer its covered demand to a hospital. Referral is defined as coverage of health centers by hospitals. We also added partial coverage to this complex hierarchic structure, that is, a demand point is fully covered up to the minimum critical distance, non-covered after the maximum critical distance and covered with a decreasing quality while increasing distance to the facility between minimum and maximum critical distances. We developed an MIP formulation to solve the Hierarchical Maximal Covering Location Problem with referral in the presence of partial coverage. We solved small-size problems optimally using GAMS. For large-size problems we developed a Genetic Algorithm that gives near-optimal results quickly. We tested our Genetic Algorithm on randomly generated problems of sizes up to 1000 nodes.
Subject Keywords
Analysis.
URI
http://etd.lib.metu.edu.tr/upload/12608771/index.pdf
https://hdl.handle.net/11511/17118
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A partial coverage hierarchical location allocation model for health services
Karasakal, Orhan; Karasakal, Esra; Toreyen, Ozgun (2023-01-01)
We consider a hierarchical maximal covering location problem (HMCLP) to locate health centres and hospitals so that the maximum demand is covered by two levels of services in a successively inclusive hierarchy. We extend the HMCLP by introducing the partial coverage and a new definition of the referral. The proposed model may enable an informed decision on the healthcare system when dynamic adaptation is required, such as a COVID-19 pandemic. We define the referral as coverage of health centres by hospitals...
Basis in nuclear Frechet spaces
Erkurşun, Nazife; Nurlu, Mehmet Zafer; Department of Mathematics (2006)
Existence of basis in locally convex space has been an important problem in functional analysis for more than 40 years. In this thesis the conditions for the existence of basis are examined. These thesis consist of three parts. The first part is about the exterior interpolative conditions. The second part deals with the inner interpolative conditions on nuclear frechet space. These are sufficient conditions on existence of basis. In the last part, it is shown that for a regular nuclear Köthe space the inner...
Local operator spaces, unbounded operators and multinormed C*-algebras
Dosiev, Anar (Elsevier BV, 2008-10-01)
In this paper we propose a representation theorem for local operator spaces which extends Ruan's representation theorem for operator spaces. Based upon this result, we introduce local operator systems which are locally convex versions of the operator systems and prove Stinespring theorem for local operator systems. A local operator C*-algebra is an example of a local operator system. Finally, we investigate the injectivity in both local operator space and local operator system senses, and prove locally conv...
A hybrid methodology in process modeling: “from-to chart based process discovery”
Esgin, Eren; Karagöz, Pınar; Department of Information Systems (2009)
The managing of complex business processes, which are changed due to globalization, calls for the development of powerful information systems that offer generic process modeling and process execution capabilities. Even though contemporary information systems are more and more utilized in enterprises, their actual impact in automatizing complex business process is still limited by the difficulties encountered in design phase. Actually this design phase is time consuming, often subjective and incomplete. In t...
Multiresolution analysis of S&P500 time series
KILIC, Deniz Kenan; Uğur, Ömür (2018-01-01)
Time series analysis is an essential research area for those who are dealing with scientific and engineering problems. The main objective, in general, is to understand the underlying characteristics of selected time series by using the time as well as the frequency domain analysis. Then one can make a prediction for desired system to forecast ahead from the past observations. Time series modeling, frequency domain and some other descriptive statistical data analyses are the primary subjects of this study: i...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. Töreyen, “Hierarchical maximal covering location problem with referral in the presence of partial coverage,” M.S. - Master of Science, Middle East Technical University, 2007.