Show simple item record

dc.contributor.advisorTansel, Barbaros Ç.en_US
dc.contributor.authorBalcı, Pelinen_US
dc.date.accessioned2016-01-08T20:03:15Z
dc.date.available2016-01-08T20:03:15Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/11693/16920
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2012.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2012.en_US
dc.descriptionIncludes bibliographical references leaves 127-130.en_US
dc.description.abstractThis thesis aims to evaluate the locations of the existing fire stations in the city of Ankara. Vertex restricted p-center problem is solved via set covering problem and optimal locations of fire stations are found. We evaluate the fire stations in two ways. The first study aims to locate the same number of fire stations with the existing case. We use an algorithm proposed by Tansel (2011) which solves a finite series of set covering problems to reach the optimal solution of the p-center problem. We use three approaches for the p-center solution which constitutes our first study. In the first approach, we optimally locate the fire stations while keeping their allocation sets the same as those of the existing stations.In the second approach, we locate the fire stations to minimize the maximum of the distances between demand nodes and their closest stations. In the last approach, we take the population of the nodes into account and solve a weighted p-center problem where the weights of demand nodes are defined by their composite populations. We also give a methodology to compute the composite population counts for nodes. In the second study, we locate a minimum number of fire stations while ensuring that each demand node is covered within a pre-determined upper bound on the service time (distance). The bounds are taken to be 4 minutes and 8 minutes in accordance with the internationally accepted norms. Optimally located fire stations are found for both time restrictions. There are two subcases for this study; one of them aims to locate the fire stations without considering the existing fire stations while the other one locates the new fire stations in addition to the existing fire stations. Optimal solutions for all the cases explained above are compared with the existing fire stations with regard to the maximum distances, populations, and covered regions. Assessments are made on existing fire stations by benchmarking their performances against optimal solutions obtained via pcenter or covering solutions as outlined above. Geographical information systems are used for obtaining the demographic data and presenting visual analysis.en_US
dc.description.statementofresponsibilityBalcı, Pelinen_US
dc.format.extentxxiii, 202 leaves, illustrations, mapsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectoptimal locationsen_US
dc.subjectlocation coveringen_US
dc.subjectp-center locationen_US
dc.subjectfire stationsen_US
dc.subject.lccT57.6 .B35 2012en_US
dc.subject.lcshOperations research.en_US
dc.subject.lcshFire departments--Mathematical models.en_US
dc.titleAnalysis of locations of existing fire stations in Ankara in comparison to optimized locationsen_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record