Tahir, Abrha (2015) Location Problems on Weighted Graphs Stream: Optimization. Masters thesis, Addis Ababa University.
![[img]](http://thesisbank.jhia.ac.ke/style/images/fileicons/application_pdf.png) |
PDF (Location Problems on Weighted Graphs Stream: Optimization)
Abrha Tahir.pdf - Accepted Version Restricted to Repository staff only Download (822kB) | Request a copy |
Abstract
Network location problems occur when new facilities are to be located on a network. The facility location problems locate a set of facilities (resources) to minimize the cost of satisfying some set of demands (of customers) with respect to some set of constraints. Locating a facility to the best place is a decision making problem. The best place depends on criteria like the optimal distance, the capacity of the facility, population density, and optimal cost etc. so the goal of solving location problems is to find the best location or locations to fit one or more facility which will make the highest utility value. In this project,two sets of location problems such as the median and the center location problems are presented to locate facilities on weighted graphs(or networks). To solve the optimal solutions that identify the median and center location of the weighted graph, we first compute the all pairs shortest path distance of the weighted graph. thus,the all pair - label correcting algorithm implemented by the Floyd-Warshals algorithm was applied to compute the distance matrix. We also examine some of the heuristic methods and binary search techniques developed to solve the problems.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | H Social Sciences > HA Statistics Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Africana |
| Depositing User: | Selom Ghislain |
| Date Deposited: | 18 Jun 2018 12:44 |
| Last Modified: | 18 Jun 2018 12:44 |
| URI: | http://thesisbank.jhia.ac.ke/id/eprint/4386 |
Actions (login required)
 |
View Item |