Show simple item record

dc.contributor.advisorYetiş, Bahar
dc.contributor.authorBuluç, Elfe Naz
dc.date.accessioned2018-08-03T13:33:36Z
dc.date.available2018-08-03T13:33:36Z
dc.date.copyright2018-07
dc.date.issued2018-07
dc.date.submitted2018-08-02
dc.identifier.urihttp://hdl.handle.net/11693/47724
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2018.en_US
dc.descriptionIncludes bibliographical references (pages 73-81).en_US
dc.description.abstractThe world is facing a refugee crisis because of the ongoing war in Syria, and it is important to develop refugees' life conditions and increase their integration to the host communities. There are several services given to refugees to improve humanitarian development. The distribution of cash and e-vouchers to refugees and the routing of trucks which provide Child Friendly Spaces to vulnerable refugee children are addressed in this study. Both problems have similar characteristics as they provide services using mobile vehicles. The distribution of e-vouchers problem is applied for two scenarios, where local distribution centers are opened to cover an area, and a combination of local distribution centers and hand-tohand delivery is conducted to increase the accessibility. The given problems are categorized as Covering Vehicle Routing Problem and Covering Vehicle Routing Problem with Integrated Tours which are introduced to the literature. The performance of the proposed models is tested and a sensitivity analysis on the problem parameters is given. Three optimization based heuristics are proposed to improve solving times. The proposed solutions are applied to a real life case of city Kilis. In order to apply the models to the routing of Mobile Child Friendly Spaces problem, a bi-objective version of the proposed models is given where the aim is to minimize the unsatis ed demand while minimizing travelled distance. -constraint method is applied to solve the bi-objective application and all Pareto Optimal solutions are obtained.en_US
dc.description.statementofresponsibilityby Elfe Naz Buluç.en_US
dc.format.extentx, 83 pages : illustrations, maps (some color), charts ; 30 cm.en_US
dc.language.isoen_USen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHumanitarian Logisticsen_US
dc.subjectRefugee Servicesen_US
dc.subjectCovering Vehicle Routing Problemen_US
dc.subjectIntegrated Toursen_US
dc.subjectBi-objective Optimizationen_US
dc.titleCovering vehicle routing problem: applications for refugee related servicesen_US
dc.title.alternativeKapsayıcı araç rotalama problemi: mültecilere yönelik uygulamalaren_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB158751


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record