Advisors
Now showing items 1-20 of 22
-
Analysis of locations of existing fire stations in Ankara in comparison to optimized locations
(Bilkent University, 2012)This 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 ... -
Analysis of multimedian problems on time dependent networks
(Bilkent University, 1994)Time dependency arises in transportation and computer-communication networks due to factors such as time varying demand, traffic intensity, and road conditions. This necessitates a locational decision to be based on an ... -
Concepts and analysis in facility location under uncertainty : applications to 1-median problem
(Bilkent University, 2001-08) -
A critical review of the approaches to optimization problems under uncertainty
(Bilkent University, 2001)In this study, the issue of uncertainty in optimization problems is studied. First of all, the meaning and sources of uncertainty are explained and then possible ways of its representation are analyzed. About the modelling ... -
Determination of shelter locations and evacuation routes for a possible earthquake in the city of Istanbul
(Bilkent University, 2012)In this study, the location of disaster response and relief facilities in Istanbul is investigated in view of a possible earthquake. Our objective is to determine and analyze the assignments of demand nodes to shelter ... -
Implementation of new and classical set covering based algorithms for solving the absolute p-center problem
(Bilkent University, 2011)The 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 ... -
Modeling and analysis of issues in hub location problem
(Bilkent University, 1999)The hub location problem has been around for more than 10 years. The first mathematical model was formulated by O’Kelly (1986) which is a quadratic integer program. Since then, nearly all of the researchers in this area ... -
A multi-modal discrete-event simulation model for military deployment
(Bilkent University, 2009)This study introduces a logistics and transportation simulation as a tool that can be used to provide insights into potential outcomes of proposed military deployment plans. More specifically, we model a large‐scale ... -
Multifacility location with imprecise data
(Bilkent University, 1994)Locational decisions often suffer from lack of precise data. In this study, we consider a class of multifacility location problems where the demands of existing and new facilities are unknown, with a known set of possible ... -
Optimal locations of landfills and transfer stations in solid waste management
(Bilkent University, 2002)In the recent years solid waste management has been given an increasing importance due to health factors and environmental concerns. Solid waste management refers to a complex task that covers the collection, transfer, ... -
Optimization of transportation requirements in the deployment of military units
(Bilkent University, 2005)We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of the physical movement of military units, stationed at geographically dispersed locations, from their home ... -
Planar p-center problem with Tchebychev distance
(Bilkent University, 1994)The p-center problem is a model for locating p facilities to serve clients so that the distance between a farthest client and its closest facility is minimized. Emergency service facilities such as fire stations, hospitals ... -
Polynomially solvable cases of multifacility distance constraints on cyclic networks
(Bilkent University, 1993)Distance Constraints Problem is to locate one or more new facilities on a network so that the distances between new and existing facilities as well as between pairs of new facilities do not exceed given upper bounds. The ... -
Quadratic assignment problem : linearizations and polynomial time solvable cases
(Bilkent University, 2006)The Quadratic Assignment Problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even ... -
A review of network location theory and models
(Bilkent University, 2004)In this study, we review the existing literature on network location problems. The study has a broad scope that includes problems featuring desirable and undesirable facilities, point facilities and extensive facilities, ... -
Robust solutions to single and multi-period machine layout problems with interval flows
(Bilkent University, 1997)Design clecisous are genevcUly given in the early stages when there is a great deal of inexactness in the data gathered. In this study, we consider the plant Uiyout problem witli inexactness in material flow quantities ... -
Sensitivity analysis of distance constraints and of multifacility minimax location on tree networks
(Bilkent University, 1989)In this thesis, the main concern is to investigate the use of consistency conditions of distance constraints in sensitivity analysis of certain network location problems. The interest is in minimax type of objective ... -
Single machine total tardiness problem: exact and heuristic algorithms based on Beta-sequence and decomposition theorems
(Bilkent University, 1994)The primary concern of this thesis is to analyze single machine total tardiness problem and to develop both an exact algorithm and a heuristic algorithm. The analysis of the literature reveals that exact algorithms are ... -
A spanning tree approach to solving the absolute p-center problem
(Bilkent University, 1995)The p-center problem on a network is a model to locate p new facilities that will serve n existing demand points on that network. The objective is to minimize the maximum of the weighted distances between each demand ... -
A storage assignment problem with multi-stop picking tours in an automotive spare parts warehouse
(Bilkent University, 2008)In this study, a storage assignment problem for an automobile spare parts warehouse is considered. Incoming items from the suppliers are located at storage slots in pallet loads with single stop storage tours while ...
