SOLIKHAH, DEVIANA (2019) *UTILIZATION OF SHARMA ALGORITHM IN TWO LEVEL HIERARCHICAL TIME MINIMIZATION TRANSPORTATION PROBLEM (HTMTP) TO DETERMINE THE MINIMUM SHIPMENT TIMES AT OYSTER MUSHROOM DISTRIBUTOR.* Undergraduate thesis, UNDIP.

| PDF 440Kb | |

PDF Restricted to Repository staff only 1551Kb | ||

| PDF 309Kb |

## Abstract

Transportation problems are problems related to the distribution of products with purpose to minimizing shipping costs, mileage, minimizing time and others. Two Level Hierarchical Time Minimization Transportation Problem (HTMTP) is a transportation problem minimizing shipment time which is solved by two stages of work, the first stage is looking for an initial feasible solution and the second stage is checking the optimization of the initial feasible solution so that the optimal solution is obtained. Sharma Algorithm is one of the new methods proposed by Sharma, this algorithm is used to determine the minimum shipment time of the Two-Level Hierarchical Time Minimization Transportation Problem (HTMTP) that forms the pairs ( ( ) ( )) Where for ( ) and ( ) respectively indicate Level-I and Level-II shipment times and finally the optimal solution from Two Level HTMTP namely according to the minimum value of ( ( ) ( ) ). In the utilization of the oyster mushroom distributor using the Sharma algorithm, it is obtained a minimum shipment of the time is 55 (units of time) with shipment time pairs in Level-I and Level-II is (25, 30). Keywords: Two-Level HTMTP, Sharma algorithm, optimal solutions, transportation problems minimize time.

Item Type: | Thesis (Undergraduate) |
---|---|

Subjects: | Q Science > QA Mathematics |

Divisions: | Faculty of Science and Mathematics > Department of Mathematics |

ID Code: | 84211 |

Deposited By: | Admin Departemen Matematika |

Deposited On: | 11 Jun 2022 14:43 |

Last Modified: | 11 Jun 2022 14:43 |

Repository Staff Only: item control page