Transportation Problem With Lossy Arcs
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Adefris, Nahusenay | |
| dc.date.accessioned | 2018-07-17T07:35:29Z | |
| dc.date.accessioned | 2023-11-04T12:30:41Z | |
| dc.date.available | 2018-07-17T07:35:29Z | |
| dc.date.available | 2023-11-04T12:30:41Z | |
| dc.date.issued | 2015-10-16 | |
| dc.description.abstract | The Ordinary Transportation Problem allows to model the situations where the amount of goods leaving the supply points is equal to the amount deliv- ered to the destinations. In this project, the model of Transportation Problem with lossy arcs, the situations where the amount of goods leaving the supply points is not equal to the amount delivered to the destinations (this is the case, when fragile or perishable goods are transported or the complaints may occur) is presented. Each problem of this type can be transformed to the form of a Generalized Minimum Cost Flow Problem with linear objective function. The presented solution method uses the ideas applied in the Method of Solv- ing a Generalized Minimum Cost Flow problem. Keywords: Transportation Problem with Lossy Arcs, Generalized Transportation Prob- lem, Generalized Minimum Cost Flow Problem and Generalized Network Simplex Algorithm. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8946 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Transportation Problem With Lossy Arcs | en_US |
| dc.subject | Generalized Transportation Prob- Lem | en_US |
| dc.subject | Generalized Minimum Cost Flow Problem and Generalized Network Simplex Algorithm | en_US |
| dc.title | Transportation Problem With Lossy Arcs | en_US |
| dc.type | Thesis | en_US |