Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/99096
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineering-
dc.creatorLin, Hen_US
dc.creatorXu, Men_US
dc.date.accessioned2023-06-14T01:00:17Z-
dc.date.available2023-06-14T01:00:17Z-
dc.identifier.issn0733-9488en_US
dc.identifier.urihttp://hdl.handle.net/10397/99096-
dc.language.isoenen_US
dc.publisherAmerican Society of Civil Engineers (ASCE)en_US
dc.rights© ASCEen_US
dc.rightsThis material may be downloaded for personal use only. Any other use requires prior permission of the American Society of Civil Engineers. This material may be found at https://ascelibrary.org/doi/10.1061/JUPDDM.UPENG-4104.en_US
dc.subjectBilevel programmingen_US
dc.subjectFacility locationen_US
dc.subjectHealth infrastructure planningen_US
dc.subjectQueueing theoryen_US
dc.subjectUser equilibriumen_US
dc.titleCapacitated preventive health infrastructure planning with accessibility-based service equityen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume149en_US
dc.identifier.issue1en_US
dc.identifier.doi10.1061/JUPDDM.UPENG-4104en_US
dcterms.abstractHard-to-access health infrastructure is likely to lead to increased morbidity and mortality. The optimal layout of health facilities is significant for disease control and prevention. This study aims to propose a method to provide equitable access to capacitated preventive health facilities, which captures the key features of the effect of congestion in a competitive choice environment. The problem is formulated as a bilevel nonlinear integer programming model. The upper level is a biobjective programming model subject to investment budget (B) constraint, and the lower level is a user equilibrium analogous model resulting from the users’ choice of facility location. An efficient and operable heuristic algorithm was designed according to the bilevel decision structure where a genetic algorithm (GA) with elite strategy is developed to solve the upper-level problem and the method of successive averages (MSA) is adopted to solve the lower-level problem. A case study is employed to validate the performance of the proposed method. The results show that the method is robust and could reach an equal service quality in a reasonable computation time. However, the sensitivity analysis indicated that the marginal benefit of the investment decreased. There is an optimal B beyond which further increments in investment would not offset the benefits. In addition, the proposed method could be beneficial for other congested public service facilities that users are free to choose from.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationJournal of urban planning and development, Mar. 2023, v. 149, no. 1, 04022051en_US
dcterms.isPartOfJournal of urban planning and developmenten_US
dcterms.issued2023-03-
dc.identifier.scopus2-s2.0-85141876762-
dc.identifier.eissn1943-5444en_US
dc.identifier.artn04022051en_US
dc.description.validate202306 bcch-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera2103-
dc.identifier.SubFormID46613-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextKey project of philosophy and social science research in colleges and universities in Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Hong Kong Polytechnic Universityen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Lin_Capacitated_Preventive_Health.pdfPre-Published version1.56 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

84
Citations as of Apr 14, 2025

Downloads

107
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

2
Citations as of Sep 12, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.