Periodic location routing problem : an application of mobile health services in rural area

Simple item page
buir.advisorYetiş, Bahar
dc.contributor.authorSavaşer, Sinem
dc.date.accessioned2017-07-12T11:29:01Z
dc.date.available2017-07-12T11:29:01Z
dc.date.copyright2017-06
dc.date.issued2017-06
dc.date.submitted2017-07-11
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2017.en_US
dc.descriptionIncludes bibliographical references (leaves 77-86).en_US
dc.description.abstractLack of sufficient healthcare services in rural areas has been a considerable problem throughout the world for a long time. One of the alternative ways to address and solve this problem is providing mobile healthcare services in which the providers are traveling and visiting patients. These services have been obligatory in Turkey since 2010 and there are certain requirements that are enforced by Ministry of Health, such as having multiple routinized visits, having alternative visiting rules and dedicating doctors to specified villages. Based on the characteristics of this problem, it is categorized under Periodic Location Routing Problem (PLRP) literature. The common characteristic of the solution methodologies in the PLRP literature is to predefine a set of alternative schedules and select the best one among those. Unlike the other approaches that have been already studied, the developed integer programming model determines the schedules of the doctors via its constraints, dedicates each doctor to same villages through the planning horizon and satisfies certain visiting rules. The performance of the model is tested by utilizing the data set of Burdur. The proposed model is solved to optimality in reasonable times for the small instances; however, significant optimality gaps remain at the end of predefined time limits of the larger instances. In order to obtain prominent results in shorter durations, a \cluster first, route second" based heuristic algorithm is developed. Based on the computational experiments, it is observed that the solution times are significantly improved and optimal or near-optimal solutions are obtained with the heuristic approach.en_US
dc.description.degreeM.S.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2017-07-12T11:29:01Z No. of bitstreams: 1 thesis_savasersinem.pdf: 510848 bytes, checksum: f83e89c771186e2d7e2465b4d718e920 (MD5)en
dc.description.provenanceMade available in DSpace on 2017-07-12T11:29:01Z (GMT). No. of bitstreams: 1 thesis_savasersinem.pdf: 510848 bytes, checksum: f83e89c771186e2d7e2465b4d718e920 (MD5) Previous issue date: 2017-07en
dc.description.statementofresponsibilityby Sinem Savaşer.en_US
dc.format.extentx, 89 leaves : charts (some color) ; 29 cmen_US
dc.identifier.itemidB155973
dc.identifier.urihttp://hdl.handle.net/11693/33386
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMobile healthcare servicesen_US
dc.subjectPeriodicityen_US
dc.subjectLocation routingen_US
dc.subjectInteger programmingen_US
dc.subjectCluster first route seconden_US
dc.titlePeriodic location routing problem : an application of mobile health services in rural areaen_US
dc.title.alternativePeriyodik yer seçimi ve rotalama problemi :b kırsal kesimlerde mobil sağlık hizmetleri uygulamasıen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
thesis_savasersinem.pdf
Size:
498.88 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dept. of Industrial Engineering - Master's degree