Implementation of new and classical set covering based algorithms for solving the absolute p-center problem

Simple item page
buir.advisorTansel, Barbaros Ç.
dc.contributor.authorSaç, Yiğit
dc.date.accessioned2016-01-08T18:13:03Z
dc.date.available2016-01-08T18:13:03Z
dc.date.issued2011
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2011.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2011.en_US
dc.descriptionIncludes bibliographical references leaves 80-82.en_US
dc.description.abstractThe p-center problem is a model of locating p facilities on a network in order to minimize the maximum coverage distance between each vertex and its closest facility. The main application areas of p-center problem are emergency service locations such as fire and police stations, hospitals and ambulance services. If the p facilities can be located anywhere on a network including vertices and interior points of edges, the resulting problem is referred to as the absolute p-center problem and if they are restricted to vertex locations, it is referred to as the vertex-restricted problem. The absolute p-center problem is considerably more complicated to solve than the vertex-restricted version. In the literature, most of the computational analysis and new algorithm developments are performed through the vertex restricted case of the p-center problem. The absolute p-center problem has received much less attention in the literature. In this thesis, our focus is on the absolute p-center problem based on an algorithm for the p-center problem proposed by Tansel (2009). Our work is the first one to solve large instances up to 900 vertices on the absolute p-center problem. The algorithm focuses on solving the p-center problem with a finite series of minimum set covering problems, but the set covering problems used in the algorithm are constructed differently compared to the ones traditionally used in the literature. The proposed algorithm is applicable for both absolute and vertex-restricted p-center problems with weighted and unweighted cases.en_US
dc.description.degreeM.S.en_US
dc.description.provenanceMade available in DSpace on 2016-01-08T18:13:03Z (GMT). No. of bitstreams: 1 0004046.pdf: 1733741 bytes, checksum: 1acfd5f2a47080ba9e244b00210ffc7a (MD5)en
dc.description.statementofresponsibilitySaç, Yiğiten_US
dc.format.extentvii, 82 leaves, platesen_US
dc.identifier.urihttp://hdl.handle.net/11693/15087
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectp-center problemen_US
dc.subjectabsolute p-center problemen_US
dc.subjectvertex-restricted p-center problemen_US
dc.subject.lccT57.85 .S33 2011en_US
dc.subject.lcshIndustrial location--Mathematical models.en_US
dc.subject.lcshNetwork analysis (Planning)en_US
dc.subject.lcshAlgorithms.en_US
dc.titleImplementation of new and classical set covering based algorithms for solving the absolute p-center problemen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0004046.pdf
Size:
1.65 MB
Format:
Adobe Portable Document Format
Download

Collections

Dept. of Industrial Engineering - Master's degree