TIEFANI, NURUL RAHMA (2019) *COMPARISON OF SOLVING ASSIGNMENT PROBLEM WITH HEURISTIC APPROACH AND HUNGARIAN METHOD : A CASE STUDY AT TAXI KOSTI SEMARANG.* Undergraduate thesis, UNDIP.

| PDF 339Kb | |

PDF Restricted to Repository staff only 1431Kb | ||

| PDF 96Kb |

## Abstract

Assignment problem is a special case of transportation problems where the constrains of demand and supply is equal to one. This final project studies about methods for solving assignment problem, namely Heuristic Approach that was developed by A. Seethalakshmy dan N. Srinivasan based on concept of modified transportation problem, especially from Vogel’s Approximation Method (VAM), by substracting two sequential maximum elements in each row called as row penalty and by substracting maximum element to minimum element in each called as column penalty. The maximum element is marked and the allocation is given for the least element. Comparison between the Heuristic Approach and Hungarian Method is also included to find out the solution the difference and effectivity of these methods. In the simulation at Taxi Kosti Semarang, a solution by using two different methods obtain same optimal solution where it yields waiting time of 43 minutes, but with different levels of effectiveness where levels of effectiveness by using Heuristic Approach better than Hungarian Method because the allocation and the cost of matrix can be found immediately. Key Words : Assignment problem, Heuristic Approach, Hungarian Method

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

Subjects: | Q Science > QA Mathematics |

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

ID Code: | 84268 |

Deposited By: | INVALID USER |

Deposited On: | 13 Jun 2022 11:11 |

Last Modified: | 13 Jun 2022 11:11 |

Repository Staff Only: item control page