Location-location routing problem and its application on refugee camps

Simple item page
buir.advisorYetiş, Bahar
dc.contributor.authorKumcu, Gül Çulhan
dc.date.accessioned2019-06-14T10:56:19Z
dc.date.available2019-06-14T10:56:19Z
dc.date.copyright2019-05
dc.date.issued2019-05
dc.date.submitted2019-06-13
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, 2019.en_US
dc.descriptionIncludes bibliographical references (leaves 55-60).en_US
dc.description.abstractIn the classical Location Routing Problem (LRP), the customers are at xed and known locations. Given the known customer locations, in LRP models, decisions are taken for distribution center locations and corresponding vehicle routes. However; for some public applications the locations of customers can also be decision variables coming from a discrete set. In this study we consider such an application where the locations of demand nodes will be determined while considering the distribution center location(s) and corresponding vehicle routes. To the best of our knowledge this variant of LRP has not been de ned in the location literature before. We refer this problem as Location-Location Routing Problem(L-LRP). We observe that, refugee camp location and management problem is a direct application of the L-LRP. In refugee camps certain public services are required to protect health, safety, dignity, etc. of the refugees. Thus, authorities should plan regular public service visits to the refugee camps to provide these services. In the refugee camp location problem authorities decide the locations of hosting institutions and routes of service providers originated from these institutions. Actually, in addition; authorities also decide the locations of these refugee camps. For the L-LRP, a linear mixed integer mathematical formulation is developed. To obtain results in shorter times with preserving solution qualities, a two-stage math-heuristic algorithm is presented. The computational analysis of mathematical formulation and heuristic algorithm are conducted on a real data set obtained from Southern part of Turkey.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityby Gül Çulhan Kumcuen_US
dc.embargo.release2020-06-13
dc.format.extentxi, 71 leaves : charts, maps (some color) ; 30 cm.en_US
dc.identifier.itemidB159182
dc.identifier.urihttp://hdl.handle.net/11693/52043
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectLocation routingen_US
dc.subjectRefugee camp locationen_US
dc.subjectInteger programmingen_US
dc.subjectTwostage heuristic algorithmen_US
dc.titleLocation-location routing problem and its application on refugee campsen_US
dc.title.alternativeYer seçimi-yer seçimi rotalama problemi ve mülteci kampları üzerindeki uygulamasıen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GulCulhanKumcu_LLRPandItsApplicationonRefugeeCamps.pdf
Size:
2.53 MB
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