Mixed Integer Programming Approach for Inventory Distribution System
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Genene, Aster | |
| dc.date.accessioned | 2021-01-21T06:40:24Z | |
| dc.date.accessioned | 2023-11-04T12:31:03Z | |
| dc.date.available | 2021-01-21T06:40:24Z | |
| dc.date.available | 2023-11-04T12:31:03Z | |
| dc.date.issued | 2020-12-12 | |
| dc.description.abstract | Optimization is a mathematical problem that has many real-world applica- tions. It is used to determine minimizers or maximizers of a multi-variable real function, under a restricted domain. The thesis presented here aims in determining an optimal joint inventory with transportation proposed by [10]. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. A supply chain class which helps to determine joint transport and inventory cost does have a wide variety of advantages for both company and customer. One of the op- timization parts which is mixed integer programming is applied to nd the optimal solution to Joint Transportation-and-Inventory Problems (JTIPs) which portioning of customers as well as the route and date of delivery. Two mixed-integer programming models will be discussed: time-discretized inte- ger programming and the new approach with prede ned quantities of delivery with the date of delivery. As is shown in this thesis, the approach allows us to use a simplex method and the technique for solving mixed-integer program- ming i.e., branch and bound Method, and cutting plane method. Solution procedures are clearly illustrated based on a hypothetical applications and modi cation of the model are present in this thesis. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/24732 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Inventory Routing Problem | en_US |
| dc.subject | Mixed Integer Programming Prob- Lem | en_US |
| dc.subject | Branch and Bound Method | en_US |
| dc.subject | Cutting Plane Method | en_US |
| dc.title | Mixed Integer Programming Approach for Inventory Distribution System | en_US |
| dc.type | Thesis | en_US |